Pub Date : 2018-09-01DOI: 10.1109/iccce.2018.8539331
{"title":"ICCCE 2018 List Reviewers Page","authors":"","doi":"10.1109/iccce.2018.8539331","DOIUrl":"https://doi.org/10.1109/iccce.2018.8539331","url":null,"abstract":"","PeriodicalId":260264,"journal":{"name":"2018 7th International Conference on Computer and Communication Engineering (ICCCE)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116787965","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 : 2018-09-01DOI: 10.1109/ICCCE.2018.8539250
S. Mohamad, K. Isa
This paper presents a method of an assistive robotic control system based on speech semantic recognition through implementationon hardware and simulation. This project purpose is to develop an assistive robot that used speech semantic recognition system whichmeans this robot can understand and interpret the meaning of words. This paper focused on the process of the assistive robot and howit developed. This robot can assist peoples with physical disabilities especially people who cannot move their leg or hand because it is controlled by using speech. While much attention has been paid to remote control assistive robot and voice commands through direction assistive robot, so far there is no clear definition of speech semantic for the assistive robot. EasyVR is used as the voice controller in order to process the speech in MATLAB simulation. Three locations inside a house are used, and five words per locationare used to test and clarify the effectiveness of this robot.
{"title":"Assistive Robot for Speech Semantic Recognition System","authors":"S. Mohamad, K. Isa","doi":"10.1109/ICCCE.2018.8539250","DOIUrl":"https://doi.org/10.1109/ICCCE.2018.8539250","url":null,"abstract":"This paper presents a method of an assistive robotic control system based on speech semantic recognition through implementationon hardware and simulation. This project purpose is to develop an assistive robot that used speech semantic recognition system whichmeans this robot can understand and interpret the meaning of words. This paper focused on the process of the assistive robot and howit developed. This robot can assist peoples with physical disabilities especially people who cannot move their leg or hand because it is controlled by using speech. While much attention has been paid to remote control assistive robot and voice commands through direction assistive robot, so far there is no clear definition of speech semantic for the assistive robot. EasyVR is used as the voice controller in order to process the speech in MATLAB simulation. Three locations inside a house are used, and five words per locationare used to test and clarify the effectiveness of this robot.","PeriodicalId":260264,"journal":{"name":"2018 7th International Conference on Computer and Communication Engineering (ICCCE)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121109522","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 : 2018-09-01DOI: 10.1109/ICCCE.2018.8539285
Haji. M. Furqan, M. Nazzal, H. Arslan
In this work, an iterative tap pursuit algorithm for designing channel shortening equalizers is proposed. Similar to pursuit algorithms, a residual vector is initialized with a desired target impulse response, which is iteratively approximated by one-tap sub-filters. In each iteration, the algorithm selects the location and weight of a one-tap sub-filter. This is proceeded by updating the residual vector by subtracting its already-represented portions by selected sub-filters. The advantage of this algorithm lies in its simplicity in alleviating the need for performing an exhaustive search thus reducing the computational complexity. Convergence of the proposed algorithm is guaranteed by the fact that the energy of the residual decreases with iteration. We show that the proposed algorithm has a significantly reduced computational complexity. Experiments conducted on Rayleigh fading wireless channels validate the effectiveness of the proposed algorithm in designing channel shortening filters in terms of the shortening signal-to-noise ratio measure and complexity.
{"title":"Iterative Tap Pursuit for Channel Shortening Equalizer Design","authors":"Haji. M. Furqan, M. Nazzal, H. Arslan","doi":"10.1109/ICCCE.2018.8539285","DOIUrl":"https://doi.org/10.1109/ICCCE.2018.8539285","url":null,"abstract":"In this work, an iterative tap pursuit algorithm for designing channel shortening equalizers is proposed. Similar to pursuit algorithms, a residual vector is initialized with a desired target impulse response, which is iteratively approximated by one-tap sub-filters. In each iteration, the algorithm selects the location and weight of a one-tap sub-filter. This is proceeded by updating the residual vector by subtracting its already-represented portions by selected sub-filters. The advantage of this algorithm lies in its simplicity in alleviating the need for performing an exhaustive search thus reducing the computational complexity. Convergence of the proposed algorithm is guaranteed by the fact that the energy of the residual decreases with iteration. We show that the proposed algorithm has a significantly reduced computational complexity. Experiments conducted on Rayleigh fading wireless channels validate the effectiveness of the proposed algorithm in designing channel shortening filters in terms of the shortening signal-to-noise ratio measure and complexity.","PeriodicalId":260264,"journal":{"name":"2018 7th International Conference on Computer and Communication Engineering (ICCCE)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127227268","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 : 2018-09-01DOI: 10.1109/ICCCE.2018.8539319
Syatirah Mat Zin, F. Suhaimi, Siti Noor Fazliah Mohd Noor, Aimi Syahidah Zulkipli, A. Mohamad, Nur Fatehah Md Shakur, Nurulakma Zali
A nasal consonant is the part of the manner of articulation in the Malay language. Nasal consonant consisting of bilabial consonant /m/, alveolar consonant /n/, postalveolar consonant /ŋ/ and velar consonant /ŋ/. This paper presents the study of the contact pattern in the production of consonant /m/ using Electropalatography. Nine Malay speakers involved in this study. In detecting the contact pattern during the production of consonant /m/, Reading palate, which consists of 62 electrodes were used. The data were analyzed using Articulate Assist TM Version 1.18. The result indicates that during the production of consonant /m/ there was more contact at the posterior of the hard palate compared to other zones of the palate. Additionally, the Molar Class of the subjects does not affect the pattern production of consonant /m/.
鼻辅音是马来语发音方式的一部分。由双耳辅音/m/、肺泡辅音/n/、肺泡后辅音/n/和腭辅音/n/组成的鼻辅音。本文介绍了用触电法研究辅音/m/发音时的接触模式。九位说马来语的人参与了这项研究。在检测辅音/m/发音过程中的接触模式时，使用了由62个电极组成的读颚。使用articelassist TM Version 1.18分析数据。结果表明，在发辅音/m/时，硬腭后部的接触比其他区域要多。此外，主音的磨牙级不影响辅音/m/的发音模式。
{"title":"Electropalatography Contact Pattern in the Production of Consonant /m/ Among Malay Speakers","authors":"Syatirah Mat Zin, F. Suhaimi, Siti Noor Fazliah Mohd Noor, Aimi Syahidah Zulkipli, A. Mohamad, Nur Fatehah Md Shakur, Nurulakma Zali","doi":"10.1109/ICCCE.2018.8539319","DOIUrl":"https://doi.org/10.1109/ICCCE.2018.8539319","url":null,"abstract":"A nasal consonant is the part of the manner of articulation in the Malay language. Nasal consonant consisting of bilabial consonant /m/, alveolar consonant /n/, postalveolar consonant /ŋ/ and velar consonant /ŋ/. This paper presents the study of the contact pattern in the production of consonant /m/ using Electropalatography. Nine Malay speakers involved in this study. In detecting the contact pattern during the production of consonant /m/, Reading palate, which consists of 62 electrodes were used. The data were analyzed using Articulate Assist TM Version 1.18. The result indicates that during the production of consonant /m/ there was more contact at the posterior of the hard palate compared to other zones of the palate. Additionally, the Molar Class of the subjects does not affect the pattern production of consonant /m/.","PeriodicalId":260264,"journal":{"name":"2018 7th International Conference on Computer and Communication Engineering (ICCCE)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125163074","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 : 2018-09-01DOI: 10.1109/ICCCE.2018.8539252
N. A. Fuad, Ahmad Ammar Nor Azlin, M. Zahari, M. Hanifah
The distribution system has the most portion power loss compared to the transmission and generation systems. One of the effective methods to reduce the power loss in the system is by reconfiguring the existing network. In distribution system, there are two types of switches, which are sectionalizing switches and tie-switches. Reconfiguration process changes the status of those switches until the objective is achieved. In this study, the reconfiguration method is proposed for distribution system using the Cuckoo Search Algorithm (CSA) method. The system used is a standard IEEE 33-bus radial distribution system. The main objective is to reduce the power loss in the system while satisfying the distribution constraints. The proposed method is used to give an optimal configuration of distribution network for power loss reduction and its validity is done by comparing it with Particle Swarm Optimization (PSO).
{"title":"Power Distribution Loss Reduction Using Cuckoo Search","authors":"N. A. Fuad, Ahmad Ammar Nor Azlin, M. Zahari, M. Hanifah","doi":"10.1109/ICCCE.2018.8539252","DOIUrl":"https://doi.org/10.1109/ICCCE.2018.8539252","url":null,"abstract":"The distribution system has the most portion power loss compared to the transmission and generation systems. One of the effective methods to reduce the power loss in the system is by reconfiguring the existing network. In distribution system, there are two types of switches, which are sectionalizing switches and tie-switches. Reconfiguration process changes the status of those switches until the objective is achieved. In this study, the reconfiguration method is proposed for distribution system using the Cuckoo Search Algorithm (CSA) method. The system used is a standard IEEE 33-bus radial distribution system. The main objective is to reduce the power loss in the system while satisfying the distribution constraints. The proposed method is used to give an optimal configuration of distribution network for power loss reduction and its validity is done by comparing it with Particle Swarm Optimization (PSO).","PeriodicalId":260264,"journal":{"name":"2018 7th International Conference on Computer and Communication Engineering (ICCCE)","volume":"2000 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128265950","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 : 2018-09-01DOI: 10.1109/ICCCE.2018.8539307
S. Moghaddam, M. Ghasemi
The main objective of this research is to find a resource allocation method for multicast device-to-device (D2D) communications underlaying cellular network. Assuming that the D2D users are grouped in the clusters, resource allocation is performed using six different criteria, two of which are based on the outage probability, and the other ones are based on the signal to interference plus noise ratio (SINR). The methodology is to optimally allocate the resources to the clusters based on a table including the minimum SINR (referred to S-table) or maximum outage probability (referred to O-table) of different users in the reused cellular radio resources. By comparing the numerical analysis of different methods with the simulation results of the Hungarian algorithm in the view of the total throughput and minimum and maximum outage probabilities, it is demonstrated that the allocation priority for the best low-complex method is given to the clusters with the lowest average channel quality. It is shown that, while the outage probability is below an acceptable threshold level and the computational complexity decreases with respect to the Hungarian algorithm, an increase in the throughput is obtained.
{"title":"A Low-complex/High-throughput Resource Allocation for Multicast D2D Communications","authors":"S. Moghaddam, M. Ghasemi","doi":"10.1109/ICCCE.2018.8539307","DOIUrl":"https://doi.org/10.1109/ICCCE.2018.8539307","url":null,"abstract":"The main objective of this research is to find a resource allocation method for multicast device-to-device (D2D) communications underlaying cellular network. Assuming that the D2D users are grouped in the clusters, resource allocation is performed using six different criteria, two of which are based on the outage probability, and the other ones are based on the signal to interference plus noise ratio (SINR). The methodology is to optimally allocate the resources to the clusters based on a table including the minimum SINR (referred to S-table) or maximum outage probability (referred to O-table) of different users in the reused cellular radio resources. By comparing the numerical analysis of different methods with the simulation results of the Hungarian algorithm in the view of the total throughput and minimum and maximum outage probabilities, it is demonstrated that the allocation priority for the best low-complex method is given to the clusters with the lowest average channel quality. It is shown that, while the outage probability is below an acceptable threshold level and the computational complexity decreases with respect to the Hungarian algorithm, an increase in the throughput is obtained.","PeriodicalId":260264,"journal":{"name":"2018 7th International Conference on Computer and Communication Engineering (ICCCE)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128714470","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 : 2018-09-01DOI: 10.1109/ICCCE.2018.8539268
Nurhayati, T. Kania, Luh Kesuma Wardhani, Nashrul Hakiem, Busman, H. A. Maarif
Big data is technology that has the ability to manage very large amounts of data, in very fast time to allow real-time analysis and reactions. Several clustering methods which are used to group data are Fuzzy C-Means (FCM) and K-Means Clustering. K-Means Clustering algorithm is a method of partitioning existing data into two or more group. This research goal was to compare the performance of K-Means and Fuzzy C-Means algorithms in clustering data using big data technology. In this research, Hadoop and Hive were chosen the big data technology. The knowledge of Shia history on student and lecturer of Syarif Hidayatullah State Islamic University Jakarta were the data which used in this research, The testing was done by constructing application K-Means Fuzzy C-Means using Java language, Hadoop and Hive and then test the performance of K-Means and Fuzzy C-Means algorithms in data clustering. It compares both algorithms in terms of accuracy, execution time, and time complexity of the algorithms. In the application K-Means Fuzzy C-Means, evaluation were performed with data filter and the average accuracy difference result of K-Means and Fuzzy C-Means is 8.03% with the better accuracy owned by K-Means. The average execution time difference is 718.58 ms, which K-Means was faster than is Fuzzy C-Means. The time complexities of both algorithms have the same value O(n2) and the Big O equation resulted in an average difference of 93,568 with the smallest value on K-Means. Thus, K-Means algorithm is better than the Fuzzy C-Means in terms of accuracy, execution time, and the time complexity
{"title":"Big Data Technology for Comparative Study of K-Means and Fuzzy C-Means Algorithms Performance","authors":"Nurhayati, T. Kania, Luh Kesuma Wardhani, Nashrul Hakiem, Busman, H. A. Maarif","doi":"10.1109/ICCCE.2018.8539268","DOIUrl":"https://doi.org/10.1109/ICCCE.2018.8539268","url":null,"abstract":"Big data is technology that has the ability to manage very large amounts of data, in very fast time to allow real-time analysis and reactions. Several clustering methods which are used to group data are Fuzzy C-Means (FCM) and K-Means Clustering. K-Means Clustering algorithm is a method of partitioning existing data into two or more group. This research goal was to compare the performance of K-Means and Fuzzy C-Means algorithms in clustering data using big data technology. In this research, Hadoop and Hive were chosen the big data technology. The knowledge of Shia history on student and lecturer of Syarif Hidayatullah State Islamic University Jakarta were the data which used in this research, The testing was done by constructing application K-Means Fuzzy C-Means using Java language, Hadoop and Hive and then test the performance of K-Means and Fuzzy C-Means algorithms in data clustering. It compares both algorithms in terms of accuracy, execution time, and time complexity of the algorithms. In the application K-Means Fuzzy C-Means, evaluation were performed with data filter and the average accuracy difference result of K-Means and Fuzzy C-Means is 8.03% with the better accuracy owned by K-Means. The average execution time difference is 718.58 ms, which K-Means was faster than is Fuzzy C-Means. The time complexities of both algorithms have the same value O(n2) and the Big O equation resulted in an average difference of 93,568 with the smallest value on K-Means. Thus, K-Means algorithm is better than the Fuzzy C-Means in terms of accuracy, execution time, and the time complexity","PeriodicalId":260264,"journal":{"name":"2018 7th International Conference on Computer and Communication Engineering (ICCCE)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129464165","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 : 2018-09-01DOI: 10.1109/ICCCE.2018.8539264
Nurul Arfah Che Mustapha, A. Alam, Sheroz Khan, A. Azman
A single supply differential capacitive sensing technique is presented in this paper with the focus of parasitic integration. In real application, any capacitive sensor should consider parasitic in its measurement. The aim of this paper is to analyze the effect of capacitive and resistive parasitic to the network circuit. The derivation theory of the differential capacitive sensor circuit is elaborated first. Then, comparison is made using simulation. Test was carried out using frequency from 40 k Hz up to 400 kHz. Result is presented and have shown good linearity of 0.99984 at 300 k Hz, R-squared value. Future application is expected to be used for capacitive sensor that is making use of energy harvesting application.
本文提出了一种单电源差分电容传感技术，重点研究了寄生集成。在实际应用中，任何电容式传感器在测量时都应考虑寄生。本文的目的是分析容性和电阻性寄生对网络电路的影响。首先阐述了差分电容式传感器电路的推导理论。然后用仿真方法进行了比较。测试使用频率从40k Hz到400khz。结果表明，在300 k Hz时，r平方值的线性度为0.99984。未来的应用有望用于利用能量收集应用的电容式传感器。
{"title":"Single Supply Differential Capacitive Sensor with Parasitic Capacitance and Resistance Consideration","authors":"Nurul Arfah Che Mustapha, A. Alam, Sheroz Khan, A. Azman","doi":"10.1109/ICCCE.2018.8539264","DOIUrl":"https://doi.org/10.1109/ICCCE.2018.8539264","url":null,"abstract":"A single supply differential capacitive sensing technique is presented in this paper with the focus of parasitic integration. In real application, any capacitive sensor should consider parasitic in its measurement. The aim of this paper is to analyze the effect of capacitive and resistive parasitic to the network circuit. The derivation theory of the differential capacitive sensor circuit is elaborated first. Then, comparison is made using simulation. Test was carried out using frequency from 40 k Hz up to 400 kHz. Result is presented and have shown good linearity of 0.99984 at 300 k Hz, R-squared value. Future application is expected to be used for capacitive sensor that is making use of energy harvesting application.","PeriodicalId":260264,"journal":{"name":"2018 7th International Conference on Computer and Communication Engineering (ICCCE)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133725634","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 : 2018-09-01DOI: 10.1109/ICCCE.2018.8539260
Md. Shazzadul Islam, M. Ibrahimy, S. Motakabber, DR.A.K.M ZAKIR HOSSAIN
An operating center frequency of 2.45 GHz rectangular inset fed microstrip patch antenna with defected ground structures for ISM band applications has been presented in this paper. The return loss of the proposed antenna is -29.726 dB with impedance bandwidth for $S_{11}< _{-}10mathrm {d}mathrm {B}$ is 2.441 to 2.462 GHz, that covers IEEE S02.11 g/n OFDM 20 MHz channel width. The antenna has a directional far-field pattern at the boresight direction of $0^{o}$ with a good total antenna efficiency of -1.39 dB. The proposed antenna is light weighted, easy to fabricate and achieved good directivity gain of 7.04 dBi and VSWR of 1.06 at the resonant frequency that makes it suitable for WLAN applications.
{"title":"A Rectangular Inset-Fed Patch Antenna with Defected Ground Structure for ISM Band","authors":"Md. Shazzadul Islam, M. Ibrahimy, S. Motakabber, DR.A.K.M ZAKIR HOSSAIN","doi":"10.1109/ICCCE.2018.8539260","DOIUrl":"https://doi.org/10.1109/ICCCE.2018.8539260","url":null,"abstract":"An operating center frequency of 2.45 GHz rectangular inset fed microstrip patch antenna with defected ground structures for ISM band applications has been presented in this paper. The return loss of the proposed antenna is -29.726 dB with impedance bandwidth for $S_{11}< _{-}10mathrm {d}mathrm {B}$ is 2.441 to 2.462 GHz, that covers IEEE S02.11 g/n OFDM 20 MHz channel width. The antenna has a directional far-field pattern at the boresight direction of $0^{o}$ with a good total antenna efficiency of -1.39 dB. The proposed antenna is light weighted, easy to fabricate and achieved good directivity gain of 7.04 dBi and VSWR of 1.06 at the resonant frequency that makes it suitable for WLAN applications.","PeriodicalId":260264,"journal":{"name":"2018 7th International Conference on Computer and Communication Engineering (ICCCE)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124582291","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 : 2018-09-01DOI: 10.1109/ICCCE.2018.8539301
Yu-Tang Lin, T. Jong, C. Hsieh
This paper discusses the modeling and simulation of a modified dual Mach-Zehnder interferometric sensor based perimeter intrusion detection system. First, the operating principle of the phase modulation of the optical fiber is described and the basic Mach-Zehnder interferometer and the operating principle of modified dual Mach-Zehnder interferometric perimeter intrusion detection system (MDMZIPIDS) are described. A thorough simulation model of the system, considering its optic components and all possible noise sources are established in expanded matrix form. In order to conform to the realistic simulation model, a detailed derivation of the fence vibration pertinent to its physics and mechanical properties is discussed. Finally, this paper presents the simulation results of the system, and compare them with the experimental results. From this, non-ideal components cause only the magnitude difference ofthe outputs received by photodetectors in MDMZIPIDS. With visibility noise and the polarization-induced noise, the system will be affected somehow, and with a larger force, the accuracy of the estimated intrusion position will be higher.
{"title":"Simulation of a modified dual Mach-Zehnder interferometric perimeter intrusion detection system","authors":"Yu-Tang Lin, T. Jong, C. Hsieh","doi":"10.1109/ICCCE.2018.8539301","DOIUrl":"https://doi.org/10.1109/ICCCE.2018.8539301","url":null,"abstract":"This paper discusses the modeling and simulation of a modified dual Mach-Zehnder interferometric sensor based perimeter intrusion detection system. First, the operating principle of the phase modulation of the optical fiber is described and the basic Mach-Zehnder interferometer and the operating principle of modified dual Mach-Zehnder interferometric perimeter intrusion detection system (MDMZIPIDS) are described. A thorough simulation model of the system, considering its optic components and all possible noise sources are established in expanded matrix form. In order to conform to the realistic simulation model, a detailed derivation of the fence vibration pertinent to its physics and mechanical properties is discussed. Finally, this paper presents the simulation results of the system, and compare them with the experimental results. From this, non-ideal components cause only the magnitude difference ofthe outputs received by photodetectors in MDMZIPIDS. With visibility noise and the polarization-induced noise, the system will be affected somehow, and with a larger force, the accuracy of the estimated intrusion position will be higher.","PeriodicalId":260264,"journal":{"name":"2018 7th International Conference on Computer and Communication Engineering (ICCCE)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115025108","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
扫码关注我们
求助内容：
应助结果提醒方式：