Pub Date : 2007-11-05DOI: 10.1109/ICSCN.2007.350703
Wu Lan, Yu Ningmei
In this paper, the principle of M-BOK keying was analyzed and the performance of Rake receiver on direct sequence ultra-wideband (DS-UWB) system was studied, based on a S-V multi-path statistical propagation channel model which can describe propagation characteristic of UWB signal more precisely. The simulation results show that in the UWB channel model, M-BOK keying not only achieves two functions of spreading coding and BPSK modulation, but also improves the system performance. As to different receivers, selective rake (S-Rake) receiver is much more applicable than the Partial Rake (P-Rake) receiver. For S-Rake receiver, there isn't notable difference between MRC and EGC, but EGC combination could simplify the structure of receiver
{"title":"Performance Analysis of Rake Receiver with M-BOK Keying in DS-UWB System","authors":"Wu Lan, Yu Ningmei","doi":"10.1109/ICSCN.2007.350703","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350703","url":null,"abstract":"In this paper, the principle of M-BOK keying was analyzed and the performance of Rake receiver on direct sequence ultra-wideband (DS-UWB) system was studied, based on a S-V multi-path statistical propagation channel model which can describe propagation characteristic of UWB signal more precisely. The simulation results show that in the UWB channel model, M-BOK keying not only achieves two functions of spreading coding and BPSK modulation, but also improves the system performance. As to different receivers, selective rake (S-Rake) receiver is much more applicable than the Partial Rake (P-Rake) receiver. For S-Rake receiver, there isn't notable difference between MRC and EGC, but EGC combination could simplify the structure of receiver","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"34 16 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":"123145497","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.350716
M. S. Sricharan, V. Vaidehi
Realistic user models are indispensable for performance evaluation of mobility prediction algorithms. The macrocellular wireless service user population comprises users with diverse mobility characteristics. This paper investigates mobility patterns in macrocellular wireless networks, based on empirical data gathered from several users. Based on the observed statistics a user classification based on mobility is achieved. Further the paper characterizes the distribution of cell residence time (CRT), which is the length of time that a user spends in a cell, before moving into the service area of another cell. Studies reported in literature concentrate on cell residence time distribution of mobile terminals in-session (dedicated channel allocated) and ignore their out-of-session (idle mode) characteristics, which critically influence several network management tasks. Investigation shows that a user's out-of-session CRT distribution can be accurately modeled using heavy-tailed arithmetic distribution with infinite mean and variance, contrary to the assumptions made in the literature
{"title":"Mobility Patterns in Macrocellular Wireless Networks","authors":"M. S. Sricharan, V. Vaidehi","doi":"10.1109/ICSCN.2007.350716","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350716","url":null,"abstract":"Realistic user models are indispensable for performance evaluation of mobility prediction algorithms. The macrocellular wireless service user population comprises users with diverse mobility characteristics. This paper investigates mobility patterns in macrocellular wireless networks, based on empirical data gathered from several users. Based on the observed statistics a user classification based on mobility is achieved. Further the paper characterizes the distribution of cell residence time (CRT), which is the length of time that a user spends in a cell, before moving into the service area of another cell. Studies reported in literature concentrate on cell residence time distribution of mobile terminals in-session (dedicated channel allocated) and ignore their out-of-session (idle mode) characteristics, which critically influence several network management tasks. Investigation shows that a user's out-of-session CRT distribution can be accurately modeled using heavy-tailed arithmetic distribution with infinite mean and variance, contrary to the assumptions made in the literature","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"51 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":"122861474","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.350740
M. Sumathi, P. Vanathi
In this paper, we consider reconfiguration of the virtual topology of a wavelength division multiplexed (WDM) optical network. The traffic generated by the higher layers is dynamic; hence reconfiguration is carried out in order to maximize resource utilization. We consider reconfiguration with the objective of minimizing congestion. Priority levels are assigned to the lightpaths between various node pairs based on the traffic. During reconfiguration, new lightpaths are established and existing lightpaths are removed from congested links based on the priority levels. The earlier works considered traffic volume as the basis for reconfiguration. Thus priority is given to traffic with higher priority levels. The results for congestion with and without reconfiguration have been obtained
{"title":"Priority Based Dynamic Reconfiguration of Lightpath in WDM Networks","authors":"M. Sumathi, P. Vanathi","doi":"10.1109/ICSCN.2007.350740","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350740","url":null,"abstract":"In this paper, we consider reconfiguration of the virtual topology of a wavelength division multiplexed (WDM) optical network. The traffic generated by the higher layers is dynamic; hence reconfiguration is carried out in order to maximize resource utilization. We consider reconfiguration with the objective of minimizing congestion. Priority levels are assigned to the lightpaths between various node pairs based on the traffic. During reconfiguration, new lightpaths are established and existing lightpaths are removed from congested links based on the priority levels. The earlier works considered traffic volume as the basis for reconfiguration. Thus priority is given to traffic with higher priority levels. The results for congestion with and without reconfiguration have been obtained","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"215 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":"123038772","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.350771
S. P. Joy Vasantha Rani, P. Kanagasabapathy
This paper presents the hardware realization of fast and flexible feed forward neural network which is capable of dealing with fixed point arithmetic operations using VHDL with minimum number of CLB slices and good speed of performance. The hardware architecture of neural network with two input, one output and three hidden neurons occupies only 44% of CLB slices. An efficient and fast carry look-ahead adder and Booth multiplier are the essential building blocks of the processing elements to perform parallel computation in the neural network. The activation function has been carried out based on piecewise linear approximation only with combinational logic circuits
{"title":"Multilayer Perceptron Neural Network Architecture using VHDL with Combinational Logic Sigmoid Function","authors":"S. P. Joy Vasantha Rani, P. Kanagasabapathy","doi":"10.1109/ICSCN.2007.350771","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350771","url":null,"abstract":"This paper presents the hardware realization of fast and flexible feed forward neural network which is capable of dealing with fixed point arithmetic operations using VHDL with minimum number of CLB slices and good speed of performance. The hardware architecture of neural network with two input, one output and three hidden neurons occupies only 44% of CLB slices. An efficient and fast carry look-ahead adder and Booth multiplier are the essential building blocks of the processing elements to perform parallel computation in the neural network. The activation function has been carried out based on piecewise linear approximation only with combinational logic circuits","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"23 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":"114168708","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.350789
S. Poonguzhali, B. Deepalakshmi, G. Ravindran
Ultrasound imaging has found its own place in medical applications as an effective diagnostic tool. Ultrasonic diagnostics has made possible the detection of cysts, tumors or cancers in abdominal organs. In this paper, the possibilities of an automatic classification of ultrasonic liver images by optimal selection of texture features are explored. These features are used to classify these images into four classes-normal, cyst, benign and malignant masses. The texture features are extracted using the various statistical and signal processing methods. The automatic optimal feature selection process is based on the principal component analysis. This method extracts the principal features, or directions of maximum information from the data set. Using this new reduced feature set, the abnormalities are classified using the K-means clustering method. Based on the correct classification rate, a new optimal reduced feature set is created by combining the principal features extracted from the different texture features, to get a higher classification rate
{"title":"Optimal Feature Selection and Automatic Classification of Abnormal Masses in Ultrasound Liver Images","authors":"S. Poonguzhali, B. Deepalakshmi, G. Ravindran","doi":"10.1109/ICSCN.2007.350789","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350789","url":null,"abstract":"Ultrasound imaging has found its own place in medical applications as an effective diagnostic tool. Ultrasonic diagnostics has made possible the detection of cysts, tumors or cancers in abdominal organs. In this paper, the possibilities of an automatic classification of ultrasonic liver images by optimal selection of texture features are explored. These features are used to classify these images into four classes-normal, cyst, benign and malignant masses. The texture features are extracted using the various statistical and signal processing methods. The automatic optimal feature selection process is based on the principal component analysis. This method extracts the principal features, or directions of maximum information from the data set. Using this new reduced feature set, the abnormalities are classified using the K-means clustering method. Based on the correct classification rate, a new optimal reduced feature set is created by combining the principal features extracted from the different texture features, to get a higher classification rate","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"129 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":"122075274","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.350761
Y. Yin, R. Bhuvaneswaran, Y. Katayama, N. Takahashi
Network security can be increased by filtering packets at a firewall. Packet filtering examines network packets and decides whether to accept or deny them, and these decisions are made according to policies that are established by the network administrator and implemented by specific filters. An administrator who finds it hard to understand and maintain a policy, will not easily find problems that occur when the filters are changed (added, deleted, or replaced) or when hierarchical firewalls are used and will therefore not be certain that the intended policies are implemented correctly and completely. In this paper, we consider the relations of filters as spatial relations, and propose three analysis methods (impact inferring, equality judgment, and composition analysis) to determine anomalies of firewall policies by using spatial relations between filters
{"title":"Analysis Methods of Firewall Policies by using Spatial Relationships between Filters","authors":"Y. Yin, R. Bhuvaneswaran, Y. Katayama, N. Takahashi","doi":"10.1109/ICSCN.2007.350761","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350761","url":null,"abstract":"Network security can be increased by filtering packets at a firewall. Packet filtering examines network packets and decides whether to accept or deny them, and these decisions are made according to policies that are established by the network administrator and implemented by specific filters. An administrator who finds it hard to understand and maintain a policy, will not easily find problems that occur when the filters are changed (added, deleted, or replaced) or when hierarchical firewalls are used and will therefore not be certain that the intended policies are implemented correctly and completely. In this paper, we consider the relations of filters as spatial relations, and propose three analysis methods (impact inferring, equality judgment, and composition analysis) to determine anomalies of firewall policies by using spatial relations between filters","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"2012 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":"128974312","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.350657
B. Smitha, K. A. Navas
Digital watermarking, one of the data hiding techniques has become an emerging area of research due to the wide spread use of Internet and intranets. Though the watermark is used for authentication purpose, its methodology has been adapted for hiding data in many applications namely electronic patient record (EPR) data hiding in medical images. Medical images are usually large sized images and stored without loss of redundancy. Recent researches have proven that appropriate level of JPEG (joint picture expert group) compression may be used on these image types without loss of diagnostic content. This has provided an opportunity for more rapid image transmission. This work focuses on the estimation of the data hiding capacity of region of interest (ROI) medical images and optimizing the JPEG survival level that allow acceptable JPEG compression for conventional spatial domain watermarking techniques namely LSB technique, additive technique and spread spectrum technique
{"title":"Spatial Domain- High Capacity Data Hiding in ROI Images","authors":"B. Smitha, K. A. Navas","doi":"10.1109/ICSCN.2007.350657","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350657","url":null,"abstract":"Digital watermarking, one of the data hiding techniques has become an emerging area of research due to the wide spread use of Internet and intranets. Though the watermark is used for authentication purpose, its methodology has been adapted for hiding data in many applications namely electronic patient record (EPR) data hiding in medical images. Medical images are usually large sized images and stored without loss of redundancy. Recent researches have proven that appropriate level of JPEG (joint picture expert group) compression may be used on these image types without loss of diagnostic content. This has provided an opportunity for more rapid image transmission. This work focuses on the estimation of the data hiding capacity of region of interest (ROI) medical images and optimizing the JPEG survival level that allow acceptable JPEG compression for conventional spatial domain watermarking techniques namely LSB technique, additive technique and spread spectrum technique","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":"120927203","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.350665
P. G. Kumar, D. Devaraj
Intrusion detection is a critical process in network security. It is the task of detecting, preventing and possibly reacting to the attack and intrusions in a network based computer systems. This paper presents an intrusion detection system based on self-organizing maps (SOM) and back propagation network (BPN) for visualizing and classifying intrusion. The performance of the proposed hybrid neural network approach is tested using KDD cup' 99 data available in the UCI KDD archive. The proposed approach considers all kinds of attacks under major category (normal, DOS, probe,U2R, and R2L) which provides an insightful visualization for network intrusion and works well in detecting different attacks in the considered system
{"title":"Network Intrusion Detection using Hybrid Neural Networks","authors":"P. G. Kumar, D. Devaraj","doi":"10.1109/ICSCN.2007.350665","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350665","url":null,"abstract":"Intrusion detection is a critical process in network security. It is the task of detecting, preventing and possibly reacting to the attack and intrusions in a network based computer systems. This paper presents an intrusion detection system based on self-organizing maps (SOM) and back propagation network (BPN) for visualizing and classifying intrusion. The performance of the proposed hybrid neural network approach is tested using KDD cup' 99 data available in the UCI KDD archive. The proposed approach considers all kinds of attacks under major category (normal, DOS, probe,U2R, and R2L) which provides an insightful visualization for network intrusion and works well in detecting different attacks in the considered system","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"54 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":"127690572","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.350754
B. Vinod, S. Srikanth
Digital audio broadcasting (DAB) systems are expected to gain popularity in the near future as they offer better services compared to existing FM broadcasting. An important task of a DAB receiver is frame synchronization, which involves detecting the presence of a signal and determining the start of the frame. The detection method has to be robust and provide an arbitrarily low probability of false alarm in any potential channel condition. In this paper, we propose a robust algorithm to determine the start of frame and present the performance results in simulated conditions
{"title":"A Null Symbol Detection Algorithm for DAB Receivers","authors":"B. Vinod, S. Srikanth","doi":"10.1109/ICSCN.2007.350754","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350754","url":null,"abstract":"Digital audio broadcasting (DAB) systems are expected to gain popularity in the near future as they offer better services compared to existing FM broadcasting. An important task of a DAB receiver is frame synchronization, which involves detecting the presence of a signal and determining the start of the frame. The detection method has to be robust and provide an arbitrarily low probability of false alarm in any potential channel condition. In this paper, we propose a robust algorithm to determine the start of frame and present the performance results in simulated conditions","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":"131760091","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.350727
R. Amutha
Product codes are powerful codes that can be used to correct errors or recover erasures. The simplest form of a product code is that where every row and every column is terminated by a single parity bit referred to as single parity check (SPC) product code. This code has a minimum distance of four and is thus guaranteed to recover all single, double, and triple erasure patterns. Judging the code performance based on its minimum distance is very pessimistic because the code is actually capable of recovering many higher erasure patterns. A detailed mathematical analysis has been carried out for erasure pattern of the SPC product code. We derive a formula for finding the number of unrecoverable basic pattern and the number of recoverable pattern generated from the unrecoverable basic pattern. The post decoding rate is calculated for SPC product code. Our results are in good agreement with Kousa (2002). Simulation results show that the error correcting capability of the SPC product code is beyond the minimum distance
{"title":"Erasure Correcting Capability of SPC Product Codes","authors":"R. Amutha","doi":"10.1109/ICSCN.2007.350727","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350727","url":null,"abstract":"Product codes are powerful codes that can be used to correct errors or recover erasures. The simplest form of a product code is that where every row and every column is terminated by a single parity bit referred to as single parity check (SPC) product code. This code has a minimum distance of four and is thus guaranteed to recover all single, double, and triple erasure patterns. Judging the code performance based on its minimum distance is very pessimistic because the code is actually capable of recovering many higher erasure patterns. A detailed mathematical analysis has been carried out for erasure pattern of the SPC product code. We derive a formula for finding the number of unrecoverable basic pattern and the number of recoverable pattern generated from the unrecoverable basic pattern. The post decoding rate is calculated for SPC product code. Our results are in good agreement with Kousa (2002). Simulation results show that the error correcting capability of the SPC product code is beyond the minimum distance","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"26 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":"131832812","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
扫码关注我们
求助内容：
应助结果提醒方式：