Pub Date : 2015-12-01DOI: 10.1109/RAECS.2015.7453314
Dalwinder Singh, Birmohan Singh
Nowadays, Video Steganography has emerged as the popular cover medium for hiding of information because of its storage capacity. The selection of pixels for hiding data is very crucial and should be random for security measures. Therefore, we have explored the natural randomness by using such video sequences which contain dynamic variations as a cover. The embedding is done by measuring motion in the frames. It has been achieved by using background subtraction technique which estimates the background to detect foreground pixels. These foreground pixels are then used for hiding data. The proposed algorithm is tested on public available Star dataset for validation. Experimental results show that the proposed algorithm can be used for hiding data as it provides good storage capacity and video quality.
{"title":"Data hiding in videos using Background Subtraction","authors":"Dalwinder Singh, Birmohan Singh","doi":"10.1109/RAECS.2015.7453314","DOIUrl":"https://doi.org/10.1109/RAECS.2015.7453314","url":null,"abstract":"Nowadays, Video Steganography has emerged as the popular cover medium for hiding of information because of its storage capacity. The selection of pixels for hiding data is very crucial and should be random for security measures. Therefore, we have explored the natural randomness by using such video sequences which contain dynamic variations as a cover. The embedding is done by measuring motion in the frames. It has been achieved by using background subtraction technique which estimates the background to detect foreground pixels. These foreground pixels are then used for hiding data. The proposed algorithm is tested on public available Star dataset for validation. Experimental results show that the proposed algorithm can be used for hiding data as it provides good storage capacity and video quality.","PeriodicalId":256314,"journal":{"name":"2015 2nd International Conference on Recent Advances in Engineering & Computational Sciences (RAECS)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133785467","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 : 2015-12-01DOI: 10.1109/RAECS.2015.7453366
R. Goyal, S. Kaushal
With the growth in the field of wireless technology, internet can be accessed by mobile devices through different wireless interfaces. These devices experience both horizontal and vertical handovers in heterogeneous wireless environments. Multiple Attribute Decision Making (MADM) methods can be used for network selection in heterogeneous wireless networks. Traditional MADM methods calculate the final ratings by considering the normalized values of the attributes. The main disadvantage with the normalized values is that they do not consider the actual usability of the attributes for a particular application. In this paper, a utility based fuzzy-AHP method is applied for selecting a network considering the user preferences, network conditions and energy consumption in a real time scenario like video conferencing. Four networks (WLAN1, WLAN2, WiMax, and UMTS) are considered for network selection in vertical handover scenarios. Utility value of each attribute is calculated from the utility functions. Simple Additive Weighing (SAW) is also analyzed using the utility values. Results show that with the utility based MADM methods, ratings of networks are more suitable with respect to the requirements of the application and unnecessary handovers can be avoided in comparison with traditional MADM methods.
{"title":"Effect of utility based functions on fuzzy-AHP based network selection in heterogenous wireless networks","authors":"R. Goyal, S. Kaushal","doi":"10.1109/RAECS.2015.7453366","DOIUrl":"https://doi.org/10.1109/RAECS.2015.7453366","url":null,"abstract":"With the growth in the field of wireless technology, internet can be accessed by mobile devices through different wireless interfaces. These devices experience both horizontal and vertical handovers in heterogeneous wireless environments. Multiple Attribute Decision Making (MADM) methods can be used for network selection in heterogeneous wireless networks. Traditional MADM methods calculate the final ratings by considering the normalized values of the attributes. The main disadvantage with the normalized values is that they do not consider the actual usability of the attributes for a particular application. In this paper, a utility based fuzzy-AHP method is applied for selecting a network considering the user preferences, network conditions and energy consumption in a real time scenario like video conferencing. Four networks (WLAN1, WLAN2, WiMax, and UMTS) are considered for network selection in vertical handover scenarios. Utility value of each attribute is calculated from the utility functions. Simple Additive Weighing (SAW) is also analyzed using the utility values. Results show that with the utility based MADM methods, ratings of networks are more suitable with respect to the requirements of the application and unnecessary handovers can be avoided in comparison with traditional MADM methods.","PeriodicalId":256314,"journal":{"name":"2015 2nd International Conference on Recent Advances in Engineering & Computational Sciences (RAECS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114485985","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 : 2015-12-01DOI: 10.1109/RAECS.2015.7453279
Nikita Seth, Rishi Khare
Continuous Integration (CI) is the most common practice among software developers where they integrate their work into a baseline frequently. The industry is facing huge challenges while developing Software (S/W)s at multiple sites and tested on multiple platforms. The best way to make CI faster and more efficient is to automate the build and testing process. Jenkins is a CI tool that helps in automating the complete process, reducing the work of a developer and check the development at each and every step of S/W evolution. In this paper, we discuss the implementation of Jenkins for software patch integration and release to client. We consider a real-life scenario, how the software development is carried out in corporate ventures and how Jenkins can save developers/integrators crucial work hours by automating the complete process. In this paper, Jenkins is implemented in a master/slave architecture where master node is the Jenkins server and slaves are the Jenkins clients. We discuss the usage of various plug-ins available that allow Jenkins to be used with any environment of software development.
{"title":"ACI (automated Continuous Integration) using Jenkins: Key for successful embedded Software development","authors":"Nikita Seth, Rishi Khare","doi":"10.1109/RAECS.2015.7453279","DOIUrl":"https://doi.org/10.1109/RAECS.2015.7453279","url":null,"abstract":"Continuous Integration (CI) is the most common practice among software developers where they integrate their work into a baseline frequently. The industry is facing huge challenges while developing Software (S/W)s at multiple sites and tested on multiple platforms. The best way to make CI faster and more efficient is to automate the build and testing process. Jenkins is a CI tool that helps in automating the complete process, reducing the work of a developer and check the development at each and every step of S/W evolution. In this paper, we discuss the implementation of Jenkins for software patch integration and release to client. We consider a real-life scenario, how the software development is carried out in corporate ventures and how Jenkins can save developers/integrators crucial work hours by automating the complete process. In this paper, Jenkins is implemented in a master/slave architecture where master node is the Jenkins server and slaves are the Jenkins clients. We discuss the usage of various plug-ins available that allow Jenkins to be used with any environment of software development.","PeriodicalId":256314,"journal":{"name":"2015 2nd International Conference on Recent Advances in Engineering & Computational Sciences (RAECS)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114625299","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 : 2015-12-01DOI: 10.1109/RAECS.2015.7453423
Arpandeep Kaur, Harwinder Singh Sohal, A. Sharma, K. Kaur
Wireless Sensor Network (WSN) are used in military, weather, industrial and many other industrial applications. WSN consists of the low configuration nodes with limited battery life. The security issues are one of the major concerns for the sensor networks. Therefore, the sensor nodes must be capable of mitigating the attacks along with minimizing the trade-off between energy consumption and performance. A quick encryption method namely, Rigid Relationship Based Key Security (RRBKS) is proposed in this paper. RRBKS was implemented by using the lightweight randomized keys from the two-column table to provide the best level security. The results of RRBKS were evaluated against the existing model explicitly called, Elliptic Curve Public Key Cryptography (ECPKC). The experimental results marked that the proposed model outperforms the existing model.
{"title":"A Rigid Relationship Based Key Security (RRBKS) algorithm for WSN's","authors":"Arpandeep Kaur, Harwinder Singh Sohal, A. Sharma, K. Kaur","doi":"10.1109/RAECS.2015.7453423","DOIUrl":"https://doi.org/10.1109/RAECS.2015.7453423","url":null,"abstract":"Wireless Sensor Network (WSN) are used in military, weather, industrial and many other industrial applications. WSN consists of the low configuration nodes with limited battery life. The security issues are one of the major concerns for the sensor networks. Therefore, the sensor nodes must be capable of mitigating the attacks along with minimizing the trade-off between energy consumption and performance. A quick encryption method namely, Rigid Relationship Based Key Security (RRBKS) is proposed in this paper. RRBKS was implemented by using the lightweight randomized keys from the two-column table to provide the best level security. The results of RRBKS were evaluated against the existing model explicitly called, Elliptic Curve Public Key Cryptography (ECPKC). The experimental results marked that the proposed model outperforms the existing model.","PeriodicalId":256314,"journal":{"name":"2015 2nd International Conference on Recent Advances in Engineering & Computational Sciences (RAECS)","volume":"66 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123524289","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 : 2015-12-01DOI: 10.1109/RAECS.2015.7453327
V. Puri, Y. Chauhan, Nidhi Singh
This paper presents the design of permanent magnet synchronous machine (PMSM) used as a generator at medium speed in vertical axis wind turbine. The designed PMSM is used as inner rotor configuration. This paper addresses optimization of objective function as weight of PMSM, which is a paramount aspect using proposed designs and compares their performance indices using different approaches such as gravitational search algorithm (GSA) and its hybridization with particle swarm optimization (PSO). The formulated optimization problem is programmed in MATLAB and results using GSA and GSA-PSO have been obtained and compared in detail. The GSA-PSO provides better results at reduced weight with increased efficiency and minimum regulation.
{"title":"Design optimization of permanent magnet synchronous machine for vertical axis wind turbine using gravitational search algorithm","authors":"V. Puri, Y. Chauhan, Nidhi Singh","doi":"10.1109/RAECS.2015.7453327","DOIUrl":"https://doi.org/10.1109/RAECS.2015.7453327","url":null,"abstract":"This paper presents the design of permanent magnet synchronous machine (PMSM) used as a generator at medium speed in vertical axis wind turbine. The designed PMSM is used as inner rotor configuration. This paper addresses optimization of objective function as weight of PMSM, which is a paramount aspect using proposed designs and compares their performance indices using different approaches such as gravitational search algorithm (GSA) and its hybridization with particle swarm optimization (PSO). The formulated optimization problem is programmed in MATLAB and results using GSA and GSA-PSO have been obtained and compared in detail. The GSA-PSO provides better results at reduced weight with increased efficiency and minimum regulation.","PeriodicalId":256314,"journal":{"name":"2015 2nd International Conference on Recent Advances in Engineering & Computational Sciences (RAECS)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123674274","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 : 2015-12-01DOI: 10.1109/RAECS.2015.7453347
Nasir N. Hurrah, Zubair Jan, A. Bhardwaj, S. A. Parah, A. Pandit
With the rapid developments in the IC technology and signal processing oversampled Sigma Delta (ΣΔ) ADCs have become the absolute choice among the competent data converters due to their efficient architectures and ease of implementation in VLSI technology. Their efficiency lies in the schemes to decrease area, reduce power consumption and ways to improve frequency response without putting any stress on design cost and compatibility factor. They have their own issues which need to be improved or optimized in order to run neck by neck for being compatible for the efficient designs. Decimation filter being the important block in the ΣΔ ADCs needs some improvements in some areas for meeting the demands of an efficient design. This paper presents a brief overview of ΣΔ ADCs, various techniques of decimation filter design and different architectures, design methods, and practical issues, solutions and tradeoffs.
{"title":"Oversampled Sigma Delta ADC decimation filter: Design techniques, challenges, tradeoffs and optimization","authors":"Nasir N. Hurrah, Zubair Jan, A. Bhardwaj, S. A. Parah, A. Pandit","doi":"10.1109/RAECS.2015.7453347","DOIUrl":"https://doi.org/10.1109/RAECS.2015.7453347","url":null,"abstract":"With the rapid developments in the IC technology and signal processing oversampled Sigma Delta (ΣΔ) ADCs have become the absolute choice among the competent data converters due to their efficient architectures and ease of implementation in VLSI technology. Their efficiency lies in the schemes to decrease area, reduce power consumption and ways to improve frequency response without putting any stress on design cost and compatibility factor. They have their own issues which need to be improved or optimized in order to run neck by neck for being compatible for the efficient designs. Decimation filter being the important block in the ΣΔ ADCs needs some improvements in some areas for meeting the demands of an efficient design. This paper presents a brief overview of ΣΔ ADCs, various techniques of decimation filter design and different architectures, design methods, and practical issues, solutions and tradeoffs.","PeriodicalId":256314,"journal":{"name":"2015 2nd International Conference on Recent Advances in Engineering & Computational Sciences (RAECS)","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121954449","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 : 2015-12-01DOI: 10.1109/RAECS.2015.7453416
Makhan Singh, Sarbjeet Singh
Cloud Computing is considered as next generation architecture of computing. It is the collection of interconnected servers which are provisioned dynamically on demand for execution of applications. The data stored in servers of datacenters of cloud system is generally protected through firewalls and encryption techniques. These techniques come under explicit security mechanisms. In this paper, implicit security mechanisms like Information Dispersal Algorithms and secret sharing schemes have been analyzed which provide implicit data security, reliability and availability to information. The paper also presents the performance analysis of various Information Dispersal Algorithms on the basis of their storage, availability, redundancy and security features.
{"title":"Performance analysis of implicit security mechanisms for cloud storage system","authors":"Makhan Singh, Sarbjeet Singh","doi":"10.1109/RAECS.2015.7453416","DOIUrl":"https://doi.org/10.1109/RAECS.2015.7453416","url":null,"abstract":"Cloud Computing is considered as next generation architecture of computing. It is the collection of interconnected servers which are provisioned dynamically on demand for execution of applications. The data stored in servers of datacenters of cloud system is generally protected through firewalls and encryption techniques. These techniques come under explicit security mechanisms. In this paper, implicit security mechanisms like Information Dispersal Algorithms and secret sharing schemes have been analyzed which provide implicit data security, reliability and availability to information. The paper also presents the performance analysis of various Information Dispersal Algorithms on the basis of their storage, availability, redundancy and security features.","PeriodicalId":256314,"journal":{"name":"2015 2nd International Conference on Recent Advances in Engineering & Computational Sciences (RAECS)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117127406","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 : 2015-12-01DOI: 10.1109/RAECS.2015.7453427
N. Nalawade, Minakshee M. Pawar
Forecasting of telecommunication data find difficult according to International Telecommunication Union (ITU) due to uncertainty involved and the continuous growth of data in telecommunication markets as it helps them in planning and determining their networks. So, there is a need of good forecasting model to predict the future. In this paper, Autoregressive Integrated Moving Average model is utilized for forecasting telecommunication data. This model adaptively uses auto regression, moving average or combined together if required. The major steps involved in the ARIMA model is identification, estimation and forecasting. The adaptive ARIMA model is then applied to M3-Competition Data to do forecasting of telecommunication data. The performance of the model is found out using the evaluation metrics such as Sum of Squared Regression, Root Mean Square Error, Mean Absolute Deviation, Mean Absolute Percentage Error and Maximum Absolute Error. The results proved that the ARIMA models provide 7.6% improvement than the neural network method in forecasting performance.
{"title":"Forecasting telecommunications data with Autoregressive Integrated Moving Average models","authors":"N. Nalawade, Minakshee M. Pawar","doi":"10.1109/RAECS.2015.7453427","DOIUrl":"https://doi.org/10.1109/RAECS.2015.7453427","url":null,"abstract":"Forecasting of telecommunication data find difficult according to International Telecommunication Union (ITU) due to uncertainty involved and the continuous growth of data in telecommunication markets as it helps them in planning and determining their networks. So, there is a need of good forecasting model to predict the future. In this paper, Autoregressive Integrated Moving Average model is utilized for forecasting telecommunication data. This model adaptively uses auto regression, moving average or combined together if required. The major steps involved in the ARIMA model is identification, estimation and forecasting. The adaptive ARIMA model is then applied to M3-Competition Data to do forecasting of telecommunication data. The performance of the model is found out using the evaluation metrics such as Sum of Squared Regression, Root Mean Square Error, Mean Absolute Deviation, Mean Absolute Percentage Error and Maximum Absolute Error. The results proved that the ARIMA models provide 7.6% improvement than the neural network method in forecasting performance.","PeriodicalId":256314,"journal":{"name":"2015 2nd International Conference on Recent Advances in Engineering & Computational Sciences (RAECS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124004493","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 : 2015-12-01DOI: 10.1109/RAECS.2015.7453330
V. Baghel, G. Panda, S. Verma
Optimal choice of the parameters of stepped frequency train of linear frequency modulated pulses (SFT-LFM) can substantially improve the detection potentiality of radar target. In this paper this challenging signal design problem has been formulated as a two objectives optimization problem. A minor variant of existing MOEA/D known as multiobjective evolutionary algorithm based on normalize Tchebycheff decomposition (MOEA/NTD) is developed and employed to achieve various best possible combinations of these parameters. Through simulation study the effects of the chosen parameters on mainlobe width, grating lobes and sidelobes of compressed SFT-LFM have been demonstrated. The comparison of the simulation results exhibit that the optimization performance of proposed MOEA/NTD is superior to those obtained by the MOEA/D based method.
{"title":"Efficient design of radar waveforms using novel multiobjective optimization technique","authors":"V. Baghel, G. Panda, S. Verma","doi":"10.1109/RAECS.2015.7453330","DOIUrl":"https://doi.org/10.1109/RAECS.2015.7453330","url":null,"abstract":"Optimal choice of the parameters of stepped frequency train of linear frequency modulated pulses (SFT-LFM) can substantially improve the detection potentiality of radar target. In this paper this challenging signal design problem has been formulated as a two objectives optimization problem. A minor variant of existing MOEA/D known as multiobjective evolutionary algorithm based on normalize Tchebycheff decomposition (MOEA/NTD) is developed and employed to achieve various best possible combinations of these parameters. Through simulation study the effects of the chosen parameters on mainlobe width, grating lobes and sidelobes of compressed SFT-LFM have been demonstrated. The comparison of the simulation results exhibit that the optimization performance of proposed MOEA/NTD is superior to those obtained by the MOEA/D based method.","PeriodicalId":256314,"journal":{"name":"2015 2nd International Conference on Recent Advances in Engineering & Computational Sciences (RAECS)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124874948","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 : 2015-12-01DOI: 10.1109/RAECS.2015.7453404
Manpreet Singh, H. Kaur
All the communication channels are prone to noise, which makes it difficult to recover the original data or image at the receiving end. Noise can never be completely suppressed in the channel part, this makes it even more challenging for the engineers to design the receiver that can regenerate the original data stream from the noise affected one. In this paper an impulse noise suppression median-mean filter (INSMF) is designed that works with three different window sizes to reduce the error between original and recovered values. In order to achieve a high degree of accuracy, not only the benefits of median filtering but also Normalized Euclidean Distance and mean value replacement are explored. Theoretical analysis and experimental results are drawn by taking different noise levels present in channel that determines the effectiveness of the proposed filtering method.
{"title":"A robust median-mean filter for impulse noise suppression","authors":"Manpreet Singh, H. Kaur","doi":"10.1109/RAECS.2015.7453404","DOIUrl":"https://doi.org/10.1109/RAECS.2015.7453404","url":null,"abstract":"All the communication channels are prone to noise, which makes it difficult to recover the original data or image at the receiving end. Noise can never be completely suppressed in the channel part, this makes it even more challenging for the engineers to design the receiver that can regenerate the original data stream from the noise affected one. In this paper an impulse noise suppression median-mean filter (INSMF) is designed that works with three different window sizes to reduce the error between original and recovered values. In order to achieve a high degree of accuracy, not only the benefits of median filtering but also Normalized Euclidean Distance and mean value replacement are explored. Theoretical analysis and experimental results are drawn by taking different noise levels present in channel that determines the effectiveness of the proposed filtering method.","PeriodicalId":256314,"journal":{"name":"2015 2nd International Conference on Recent Advances in Engineering & Computational Sciences (RAECS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132015428","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
扫码关注我们
求助内容：
应助结果提醒方式：