Pub Date : 2007-11-05DOI: 10.1109/ICSCN.2007.350728
M. Sangeetha, J. RajaPaul Perinbam, Revathy
A software model of hardware estimator is developed. The behavioral description is transformed into an intermediate format called control flow graph (CFG). The graph is partitioned into hardware and software. The unoptimized hardware in intermediate graph is estimated by transforming the graph into matrix format. The partitioned hardware of control flow graph is translated as behavioral network graph. The high level synthesis and logic synthesis are performed using the BNG with simple logical transformation. The final RTL obtained from the conventional synthesis method and BNG method for resource and timing constraint were presented. The cost estimation for the various control construction is being tabulated
{"title":"Hardware Estimation and Synthesis for a Codesign System","authors":"M. Sangeetha, J. RajaPaul Perinbam, Revathy","doi":"10.1109/ICSCN.2007.350728","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350728","url":null,"abstract":"A software model of hardware estimator is developed. The behavioral description is transformed into an intermediate format called control flow graph (CFG). The graph is partitioned into hardware and software. The unoptimized hardware in intermediate graph is estimated by transforming the graph into matrix format. The partitioned hardware of control flow graph is translated as behavioral network graph. The high level synthesis and logic synthesis are performed using the BNG with simple logical transformation. The final RTL obtained from the conventional synthesis method and BNG method for resource and timing constraint were presented. The cost estimation for the various control construction is being tabulated","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":"133307100","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.350757
J. Jayakumaril, Sakuntala S. Pillai
A spectrally efficient OFDM transmission technique that does not require a cyclic prefix for combating intersymbol interference (ISI) is introduced. For achieving this, partial response coding (PRC) is combined with OFDM transmission scheme. PRC is regarded as one of the best known methods for combating ISI and for achieving the Nyquist signaling rate. In this paper the performance of OFDM system using Class IV PRC is analyzed over fading channels. Simulations show that OFDM system using the proposed PRC scheme perform much better than standard systems in multipath fading channels and such a simple coding technique improves the spectral efficiency also
{"title":"Improved OFDM Transmission Over Fading Channels","authors":"J. Jayakumaril, Sakuntala S. Pillai","doi":"10.1109/ICSCN.2007.350757","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350757","url":null,"abstract":"A spectrally efficient OFDM transmission technique that does not require a cyclic prefix for combating intersymbol interference (ISI) is introduced. For achieving this, partial response coding (PRC) is combined with OFDM transmission scheme. PRC is regarded as one of the best known methods for combating ISI and for achieving the Nyquist signaling rate. In this paper the performance of OFDM system using Class IV PRC is analyzed over fading channels. Simulations show that OFDM system using the proposed PRC scheme perform much better than standard systems in multipath fading channels and such a simple coding technique improves the spectral efficiency also","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"5 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":"123787007","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.350660
M. Ramakrishnan, M.A. Baghyaveni, S. Shanmugavel
The area of adhoc networking has been receiving increasing attention among researchers in recent years, as the available wireless networking and mobile computing hardware bases are now capable of supporting the promise of this technology. Over the past few years, a variety of new routing protocols have been proposed, but the performance evaluation of each protocol shows variable results according to network parameters such as throughput, scalability, mobility and topology variation. Hence, it is challenging to find one single universal protocol or any adaptive protocol to meet all the network topology conditions, mobility patterns and scalability requirements. So, if protocols are dynamically allocated to the router nodes then it is possible to obtain an all time high throughput programmable router. Many MANET applications benefit from increased throughput, which is the focus of this work. Therefore, in this paper, a new method of dynamic reconfigurable routing (DRR) using two reactive on demand protocols viz. DSR and AODV is proposed. The DRR router monitors the throughput continuously and when the throughput plunges down below the acceptance value, it adapts to different protocol to maintain the throughput. The change of protocol to the router is done by modifying the config. in file of global mobile simulator (GLOMOSIM)
{"title":"Dynamic Reconfigurable Routing for High throughput in MANET","authors":"M. Ramakrishnan, M.A. Baghyaveni, S. Shanmugavel","doi":"10.1109/ICSCN.2007.350660","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350660","url":null,"abstract":"The area of adhoc networking has been receiving increasing attention among researchers in recent years, as the available wireless networking and mobile computing hardware bases are now capable of supporting the promise of this technology. Over the past few years, a variety of new routing protocols have been proposed, but the performance evaluation of each protocol shows variable results according to network parameters such as throughput, scalability, mobility and topology variation. Hence, it is challenging to find one single universal protocol or any adaptive protocol to meet all the network topology conditions, mobility patterns and scalability requirements. So, if protocols are dynamically allocated to the router nodes then it is possible to obtain an all time high throughput programmable router. Many MANET applications benefit from increased throughput, which is the focus of this work. Therefore, in this paper, a new method of dynamic reconfigurable routing (DRR) using two reactive on demand protocols viz. DSR and AODV is proposed. The DRR router monitors the throughput continuously and when the throughput plunges down below the acceptance value, it adapts to different protocol to maintain the throughput. The change of protocol to the router is done by modifying the config. in file of global mobile simulator (GLOMOSIM)","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"77 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":"126275454","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.350764
N. Srinivasan, V. Vaidehi
This paper discusses about a network anomaly detection system which is aimed at reduction of the number of false positives and negatives generated by conventional IDSs. A statistical model of the network activities is built using the payload and is trained with the normal behavior of user(s) in the network over a period of time. This model in-turn is used to detect deviations that are high from the expected behavior which indicate a security breach or a possible attack. The payload of the network traffic is analyzed by the system in an unsupervised manner and then classifies as normal traffic during training phase. The value-byte frequency of the application payload is calculated for each normal packet based on payload length and port number. The Mahalanobis distance and a similarity measure is then used to measure the similarity of the incoming data with the already computed values in the detection phase. This distance is then compared against a threshold value and generates an alert if it exceeds the value. In the clustering phase we provide a method to reduce the resource consumption which can easily update the stored profile using an incremental algorithm and the model is continuously updated so that it is accurate. The modeling method that is being followed is completely unsupervised and also tolerant to noise in the training data. The method proposed is also resistant to mimicry-attack. This system is designed to be integrated into other detectors in order to mitigate false positive rates so that this enriches the chances of detecting zero-day worms and new attack exploits
{"title":"Reduction of False Alarm Rate in Detecting Network Anomaly using Mahalanobis Distance and Similarity Measure","authors":"N. Srinivasan, V. Vaidehi","doi":"10.1109/ICSCN.2007.350764","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350764","url":null,"abstract":"This paper discusses about a network anomaly detection system which is aimed at reduction of the number of false positives and negatives generated by conventional IDSs. A statistical model of the network activities is built using the payload and is trained with the normal behavior of user(s) in the network over a period of time. This model in-turn is used to detect deviations that are high from the expected behavior which indicate a security breach or a possible attack. The payload of the network traffic is analyzed by the system in an unsupervised manner and then classifies as normal traffic during training phase. The value-byte frequency of the application payload is calculated for each normal packet based on payload length and port number. The Mahalanobis distance and a similarity measure is then used to measure the similarity of the incoming data with the already computed values in the detection phase. This distance is then compared against a threshold value and generates an alert if it exceeds the value. In the clustering phase we provide a method to reduce the resource consumption which can easily update the stored profile using an incremental algorithm and the model is continuously updated so that it is accurate. The modeling method that is being followed is completely unsupervised and also tolerant to noise in the training data. The method proposed is also resistant to mimicry-attack. This system is designed to be integrated into other detectors in order to mitigate false positive rates so that this enriches the chances of detecting zero-day worms and new attack exploits","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"92 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":"125857985","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.350701
P. Dinakar, R. David Koilpillai
In this paper, a new low-complexity frequency-domain based technique is proposed for channel equalization and symbol detection of an enhanced data rate for global evolution (EDGE) cellular system, which uses 8-PSK modulation. The proposed method exploits the present of tail symbols in the EDGE slot structure and uses them as partial cyclic prefix in the frequency domain equalizer. For channels with longer memory than the tail length, the receiver computes a channel shortening filter such that, when the filter is cascaded with receive chain, results in a shorter effective impulse response. The parameters of the channel shortening are set such that the effective impulse response memory length is equal to the tail length. The performance of the proposed system is demonstrated by computer simulations
{"title":"A Low Complexity EDGE Demodulator Based on FDE and Impulse Response Shortening","authors":"P. Dinakar, R. David Koilpillai","doi":"10.1109/ICSCN.2007.350701","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350701","url":null,"abstract":"In this paper, a new low-complexity frequency-domain based technique is proposed for channel equalization and symbol detection of an enhanced data rate for global evolution (EDGE) cellular system, which uses 8-PSK modulation. The proposed method exploits the present of tail symbols in the EDGE slot structure and uses them as partial cyclic prefix in the frequency domain equalizer. For channels with longer memory than the tail length, the receiver computes a channel shortening filter such that, when the filter is cascaded with receive chain, results in a shorter effective impulse response. The parameters of the channel shortening are set such that the effective impulse response memory length is equal to the tail length. The performance of the proposed system is demonstrated by computer simulations","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":"131189867","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.350759
V. Vaidehi, N. Srinivasan, P. Anand, A. Balaji, V. Prashanth, S. Sangeetha
The increasing cyber threat with the expansion of Web applications demands a constant need for safeguarding our own network resources from vulnerability exploits. Attacks can occur at the network and application level. The existent solutions like firewalls perform well at the network level. The application level detection is based on raw content matching and hence is prone to errors. This paper proposes a design, implementation and performance of an intelligent IDS which looks into the semantics of the application header and also the Web presentation language. The model presented is compatible to work with semantic processors like the XAMBALA semantic processor (XSP), that can look at the structure and content of the traffic
{"title":"A Semantics Based Application Level Intrusion Detection System","authors":"V. Vaidehi, N. Srinivasan, P. Anand, A. Balaji, V. Prashanth, S. Sangeetha","doi":"10.1109/ICSCN.2007.350759","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350759","url":null,"abstract":"The increasing cyber threat with the expansion of Web applications demands a constant need for safeguarding our own network resources from vulnerability exploits. Attacks can occur at the network and application level. The existent solutions like firewalls perform well at the network level. The application level detection is based on raw content matching and hence is prone to errors. This paper proposes a design, implementation and performance of an intelligent IDS which looks into the semantics of the application header and also the Web presentation language. The model presented is compatible to work with semantic processors like the XAMBALA semantic processor (XSP), that can look at the structure and content of the traffic","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"52 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":"130710330","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.350670
G. Ananthakrishna, H. G. Ranjani, A. Ramakrishnan
This paper describes a method of automated segmentation of speech assuming the signal is continuously time varying rather than the traditional short time stationary model. It has been shown that this representation gives comparable if not marginally better results than the other techniques for automated segmentation. A formulation of the 'Bach' (music semitonal) frequency scale filter-bank is proposed. A comparative study has been made of the performances using Mel, Bark and Bach scale filter banks considering this model. The preliminary results show up to 80 % matches within 20 ms of the manually segmented data, without any information of the content of the text and without any language dependence. 'Bach' filters are seen to marginally outperform the other filters
{"title":"Comparative Study of Filter-Bank Mean-Energy Distance for Automated Segmentation of Speech Signals","authors":"G. Ananthakrishna, H. G. Ranjani, A. Ramakrishnan","doi":"10.1109/ICSCN.2007.350670","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350670","url":null,"abstract":"This paper describes a method of automated segmentation of speech assuming the signal is continuously time varying rather than the traditional short time stationary model. It has been shown that this representation gives comparable if not marginally better results than the other techniques for automated segmentation. A formulation of the 'Bach' (music semitonal) frequency scale filter-bank is proposed. A comparative study has been made of the performances using Mel, Bark and Bach scale filter banks considering this model. The preliminary results show up to 80 % matches within 20 ms of the manually segmented data, without any information of the content of the text and without any language dependence. 'Bach' filters are seen to marginally outperform the other filters","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"38 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":"129580944","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.350680
Vibhutesh Kumar Singh, N. Rajpal
This paper is concerned with the problem of non-uniform sampling and reconstruction of data. A fast and robust method for approximation of contour from a set of non-uniformly distributed sample points is described here. Data is represented by irregular samples distributed in space. The samples are chosen along the contour with spacing determined by the error between the original contour and the contour reconstructed by uniform set of sample points. Lagrange's interpolation is used to reconstruct the contour back from non-uniform set of samples. The algorithm iteratively finds the minimum number of samples along the contour. The error analysis between original and reconstructed contour reveals that iterative algorithm of selecting irregular samples is satisfactory
{"title":"Data Compression using Non - Uniform Sampling","authors":"Vibhutesh Kumar Singh, N. Rajpal","doi":"10.1109/ICSCN.2007.350680","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350680","url":null,"abstract":"This paper is concerned with the problem of non-uniform sampling and reconstruction of data. A fast and robust method for approximation of contour from a set of non-uniformly distributed sample points is described here. Data is represented by irregular samples distributed in space. The samples are chosen along the contour with spacing determined by the error between the original contour and the contour reconstructed by uniform set of sample points. Lagrange's interpolation is used to reconstruct the contour back from non-uniform set of samples. The algorithm iteratively finds the minimum number of samples along the contour. The error analysis between original and reconstructed contour reveals that iterative algorithm of selecting irregular samples is satisfactory","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"52 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":"124527338","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.350776
B. Vinay Kumar, B. Shreyas, C.N.S. Ganesh Murthy
We present a system for recognizing human faces from a database consisting of multiple images per test subject, which spans the normal variations in a human face. The faces are represented based on a Gabor wavelet transform. The features are extracted as a vector of values using a carefully chosen symmetrical Gabor wavelet matrix. This feature extraction is biologically motivated and models systems based on human vision. The extracted features are fed into an artificial neural network, in dual phases. The training and testing phases of the neural network work on the features extracted by the same method. Excellent pattern-recognition-specific neural network like a multilayer perceptron with back propagation provides the necessary classification once the feature extraction is complete
{"title":"A Back Propagation Based Face Recognition Model, using 2D Symmetrical Gabor Features","authors":"B. Vinay Kumar, B. Shreyas, C.N.S. Ganesh Murthy","doi":"10.1109/ICSCN.2007.350776","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350776","url":null,"abstract":"We present a system for recognizing human faces from a database consisting of multiple images per test subject, which spans the normal variations in a human face. The faces are represented based on a Gabor wavelet transform. The features are extracted as a vector of values using a carefully chosen symmetrical Gabor wavelet matrix. This feature extraction is biologically motivated and models systems based on human vision. The extracted features are fed into an artificial neural network, in dual phases. The training and testing phases of the neural network work on the features extracted by the same method. Excellent pattern-recognition-specific neural network like a multilayer perceptron with back propagation provides the necessary classification once the feature extraction is complete","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"22 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":"133595041","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.350685
V. N. Manjunath Aradhya, G. Hemantha Kumar, S. Noushath
The performance of a character recognition system depends heavily on what features are being used. Though many kinds of features have been developed and their test performances on standard database have been reported, there is still room to improve the recognition rate by developing improved features. In this paper, we propose a novel system based on radon transform for handwritten digit recognition. We have used radon function which represents an image as a collection of projections along various directions. The resultant feature vector by applying this method is the input for the classification stage. A nearest neighbor classifier is used for the subsequent recognition purpose. A test performed on the MNIST handwritten numeral database and on Kannada handwritten numerals demonstrate the effectiveness and feasibility of the proposed method
{"title":"Robust Unconstrained Handwritten Digit Recognition using Radon Transform","authors":"V. N. Manjunath Aradhya, G. Hemantha Kumar, S. Noushath","doi":"10.1109/ICSCN.2007.350685","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350685","url":null,"abstract":"The performance of a character recognition system depends heavily on what features are being used. Though many kinds of features have been developed and their test performances on standard database have been reported, there is still room to improve the recognition rate by developing improved features. In this paper, we propose a novel system based on radon transform for handwritten digit recognition. We have used radon function which represents an image as a collection of projections along various directions. The resultant feature vector by applying this method is the input for the classification stage. A nearest neighbor classifier is used for the subsequent recognition purpose. A test performed on the MNIST handwritten numeral database and on Kannada handwritten numerals demonstrate the effectiveness and feasibility of the proposed method","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"25 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":"131397648","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
扫码关注我们
求助内容：
应助结果提醒方式：