Vehicle communication is being utilized to provide a variety of services in the area of intelligent transport systems (ITS) by merging the communication systems and the automotive industry. In general, vehicle communication is used for vehicle-to-vehicle (V2V) and vehicle-to-infra (V2I) communications by adopting the IEEE 802.11p / 1609 standard known as wireless access in vehicular environments (WAVE). In intelligent traffic system, vehicle information is collected by exchanging information between the roadside unit (RSU) and the vehicle. The vehicle density within the range of one RSU changes with time. The higher the vehicle density, the more vehicle information is collected on a single RSU and the probability of packet collision increases. In this paper, we analyze the vehicle to infrastructure (V2I) and vehicle to vehicle (V2V) wireless channel characteristics of the WAVE communication system based on IEEE 802.11p standard in domestic urban and highway environments to solve the phenomenon that the communication performance is deterioration when concentrated on this one infrastructure. When there are multiple vehicles communicating with a single infrastructure, the collision rate increases, which makes communication difficult. In this paper, we propose a distance-based grouping algorithm that groups multiple vehicles and communicates between groups. By using the algorithm proposed in this paper, the collision rate is reduced by an average of 4.2%.
{"title":"Extended IEEE 802.11p using distance-based grouping algorithm","authors":"Baul Lee, Jin-Yeong Um","doi":"10.19101/IJACR.SOC46","DOIUrl":"https://doi.org/10.19101/IJACR.SOC46","url":null,"abstract":"Vehicle communication is being utilized to provide a variety of services in the area of intelligent transport systems (ITS) by merging the communication systems and the automotive industry. In general, vehicle communication is used for vehicle-to-vehicle (V2V) and vehicle-to-infra (V2I) communications by adopting the IEEE 802.11p / 1609 standard known as wireless access in vehicular environments (WAVE). In intelligent traffic system, vehicle information is collected by exchanging information between the roadside unit (RSU) and the vehicle. The vehicle density within the range of one RSU changes with time. The higher the vehicle density, the more vehicle information is collected on a single RSU and the probability of packet collision increases. In this paper, we analyze the vehicle to infrastructure (V2I) and vehicle to vehicle (V2V) wireless channel characteristics of the WAVE communication system based on IEEE 802.11p standard in domestic urban and highway environments to solve the phenomenon that the communication performance is deterioration when concentrated on this one infrastructure. When there are multiple vehicles communicating with a single infrastructure, the collision rate increases, which makes communication difficult. In this paper, we propose a distance-based grouping algorithm that groups multiple vehicles and communicates between groups. By using the algorithm proposed in this paper, the collision rate is reduced by an average of 4.2%.","PeriodicalId":273530,"journal":{"name":"International Journal of Advanced Computer Research","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130970321","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}
Sunwoo Kim, S. Park, Hyowon W Jeong, Junghwan Sung
For safe driving, drivers should always keep their eyes on the road ahead and focus on driving. However, many drivers engage in other activities while driving, such as using mobile phones. The development of information technology and vehicle automation has led to rapid expansion in the control interfaces of automobiles, which in turn has led to increases in incidents of distracted driving. A number of studies have been conducted to measure and inform these risks, among which the visual occlusion test, lane change test, and detection response rate tests are widely used. However, each of these methods has many problems such as the risk of actual vehicle driving and deterioration of immersion due to simulated driving. As an alternative, a virtual reality (VR) driving simulator is proposed. This simulator improves immersion and also includes a method to detect response time by extracting the log data automatically during the driving test. The VR driving simulator proposed in this paper is expected to improve immersion and cost effectiveness of simulated driving. In addition, the VR simulator provides automatic objective data to measure driving distraction and a safe testing environment compared to actual road driving tests.
{"title":"Study on response time measurement of distracted driving by virtual reality driving simulator","authors":"Sunwoo Kim, S. Park, Hyowon W Jeong, Junghwan Sung","doi":"10.19101/IJACR.MUL16002","DOIUrl":"https://doi.org/10.19101/IJACR.MUL16002","url":null,"abstract":"For safe driving, drivers should always keep their eyes on the road ahead and focus on driving. However, many drivers engage in other activities while driving, such as using mobile phones. The development of information technology and vehicle automation has led to rapid expansion in the control interfaces of automobiles, which in turn has led to increases in incidents of distracted driving. A number of studies have been conducted to measure and inform these risks, among which the visual occlusion test, lane change test, and detection response rate tests are widely used. However, each of these methods has many problems such as the risk of actual vehicle driving and deterioration of immersion due to simulated driving. As an alternative, a virtual reality (VR) driving simulator is proposed. This simulator improves immersion and also includes a method to detect response time by extracting the log data automatically during the driving test. The VR driving simulator proposed in this paper is expected to improve immersion and cost effectiveness of simulated driving. In addition, the VR simulator provides automatic objective data to measure driving distraction and a safe testing environment compared to actual road driving tests.","PeriodicalId":273530,"journal":{"name":"International Journal of Advanced Computer Research","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125738489","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}
Recently, to store a large amount of data for the blockchain decentralized applications, off-blockchain data storage techniques interworking with blockchain have emerged. However, these off-blockchain data storage techniques essentially cause the issue that it is difficult to control the user authentication and the access rights for each user outside the associated blockchain. In this paper, we introduce an implementation technique for supporting group workspaces based on the Ethereum blockchain, which provides secure file management among group users. To store large size files in group workspaces, a system structure is also being proposed where the Ethereum blockchain can stably interwork with the associated off–blockchain storage. Also, based on the file access rights stored in the Ethereum blockchain, we propose a systematic access control process for files shared among group members in the off-blockchain storage. In addition, to show the validity of the proposed technique, we present an Ethereum decentralized application called Bspace for using group workspaces interworking with off-blockchain storage.
{"title":"Bspace: a group workspace over the Ethereum blockchain with off-blockchain storage","authors":"Jae-Hwan Jin, H. Eom, Myung-Joon Lee","doi":"10.19101/ijacr.com16003","DOIUrl":"https://doi.org/10.19101/ijacr.com16003","url":null,"abstract":"Recently, to store a large amount of data for the blockchain decentralized applications, off-blockchain data storage techniques interworking with blockchain have emerged. However, these off-blockchain data storage techniques essentially cause the issue that it is difficult to control the user authentication and the access rights for each user outside the associated blockchain. In this paper, we introduce an implementation technique for supporting group workspaces based on the Ethereum blockchain, which provides secure file management among group users. To store large size files in group workspaces, a system structure is also being proposed where the Ethereum blockchain can stably interwork with the associated off–blockchain storage. Also, based on the file access rights stored in the Ethereum blockchain, we propose a systematic access control process for files shared among group members in the off-blockchain storage. In addition, to show the validity of the proposed technique, we present an Ethereum decentralized application called Bspace for using group workspaces interworking with off-blockchain storage.","PeriodicalId":273530,"journal":{"name":"International Journal of Advanced Computer Research","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114262274","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-11-30DOI: 10.19101/ijacr.2018.839007
Edwin R. Arboleda
Civet coffee is regarded as the most expensive coffee in the world. Owing to its high price the conventional method of harvesting civet coffee in the wild has been replaced by a farming method, wherein the wild civet cats are being captured, caged, and then force-fed with ripe, hand-picked, coffee cherries. This is contrary to the production of wild civet coffee from the ripest and sweetest coffee cherries, carefully picked by the civet cat. As the wild civet coffee is quite hard to obtain, most of the civet coffee commercially sold as authentic civet coffee is actually from a caged civet cat. Traders and consumers have no way of differentiating the civet coffee from other types of coffee. This study aimed to differentiate caged civet coffee beans from ordinary green coffee beans. The technique used was the near infrared spectroscopy (NIRS) as it is nondestructive and can generate quick results. A total of 218 samples were scanned, which generated absorbance in the entire 780 wavelength capacity of the Cavite State University Indium, Gallium and Arsenic (CvSU InGaAs)-based NIR instrument, ranging from 904 to 1684 nanometres (nm). A total of 170,040 spectra were generated. The average spectral absorbance’s having major differences between the two groups, were chosen, which are 907nm, 1088 nm, 1540 nm and 1650 nm, respectively. Out of 218 samples , 130 samples were used as training data, 40 samples as testing data, and the remaining 48 samples for validation purposes. The training data were subjected to the 4 layers, 15 neurons feed forward back propagation artificial neural network (FFBPANN) for training. Classification scores of 95% to 100% were achieved. Using the combined NIRS and FFBPANN, the civet coffee can be successfully discriminated from coffee beans not eaten by a civet.
{"title":"Discrimination of civet coffee using near infrared spectroscopy and artificial neural network","authors":"Edwin R. Arboleda","doi":"10.19101/ijacr.2018.839007","DOIUrl":"https://doi.org/10.19101/ijacr.2018.839007","url":null,"abstract":"Civet coffee is regarded as the most expensive coffee in the world. Owing to its high price the conventional method of harvesting civet coffee in the wild has been replaced by a farming method, wherein the wild civet cats are being captured, caged, and then force-fed with ripe, hand-picked, coffee cherries. This is contrary to the production of wild civet coffee from the ripest and sweetest coffee cherries, carefully picked by the civet cat. As the wild civet coffee is quite hard to obtain, most of the civet coffee commercially sold as authentic civet coffee is actually from a caged civet cat. Traders and consumers have no way of differentiating the civet coffee from other types of coffee. This study aimed to differentiate caged civet coffee beans from ordinary green coffee beans. The technique used was the near infrared spectroscopy (NIRS) as it is nondestructive and can generate quick results. A total of 218 samples were scanned, which generated absorbance in the entire 780 wavelength capacity of the Cavite State University Indium, Gallium and Arsenic (CvSU InGaAs)-based NIR instrument, ranging from 904 to 1684 nanometres (nm). A total of 170,040 spectra were generated. The average spectral absorbance’s having major differences between the two groups, were chosen, which are 907nm, 1088 nm, 1540 nm and 1650 nm, respectively. Out of 218 samples , 130 samples were used as training data, 40 samples as testing data, and the remaining 48 samples for validation purposes. The training data were subjected to the 4 layers, 15 neurons feed forward back propagation artificial neural network (FFBPANN) for training. Classification scores of 95% to 100% were achieved. Using the combined NIRS and FFBPANN, the civet coffee can be successfully discriminated from coffee beans not eaten by a civet.","PeriodicalId":273530,"journal":{"name":"International Journal of Advanced Computer Research","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123563262","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-11-30DOI: 10.19101/ijacr.2018.839013
M. Hammad, Ruba Alzyoudi, A. Otoom
It is widely accepted that most development cost is spent for maintenance and most of the maintenance cost is spent on comprehension. Maintainers need to understand the current status of the code before updating it. For this reason, they examine pervious change requests and previous code changes to understand how the current code was evolved. The problem that faces them is how to locate related previous change requests that handled a specific feature or topic in the code. Quickly locating previous related change requests help developers to quickly understand the current status of the code and hence reduce the maintenance cost which is our ultimate goal. This paper proposes an automated technique to identify related previous change requests stored in bug reports. The technique is based on clustering bug reports based on their textual similarities. The result of the clustering is disjoint clusters of related bug reports that have common issues, topic or feature. A set of terms is extracted from each cluster, as tags, to help maintainers to understand the issue, topic or feature handled by the bug reports in the cluster. An experimental study is applied and discussed, followed by manual evaluation of the bug reports in the generated clusters.
{"title":"Automatic clustering of bug reports","authors":"M. Hammad, Ruba Alzyoudi, A. Otoom","doi":"10.19101/ijacr.2018.839013","DOIUrl":"https://doi.org/10.19101/ijacr.2018.839013","url":null,"abstract":"It is widely accepted that most development cost is spent for maintenance and most of the maintenance cost is spent on comprehension. Maintainers need to understand the current status of the code before updating it. For this reason, they examine pervious change requests and previous code changes to understand how the current code was evolved. The problem that faces them is how to locate related previous change requests that handled a specific feature or topic in the code. Quickly locating previous related change requests help developers to quickly understand the current status of the code and hence reduce the maintenance cost which is our ultimate goal. This paper proposes an automated technique to identify related previous change requests stored in bug reports. The technique is based on clustering bug reports based on their textual similarities. The result of the clustering is disjoint clusters of related bug reports that have common issues, topic or feature. A set of terms is extracted from each cluster, as tags, to help maintainers to understand the issue, topic or feature handled by the bug reports in the cluster. An experimental study is applied and discussed, followed by manual evaluation of the bug reports in the generated clusters.","PeriodicalId":273530,"journal":{"name":"International Journal of Advanced Computer Research","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134464243","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-11-30DOI: 10.19101/IJACR.2018.838013
Vijayalaxmi Jamagoud, Satish S. Bhairannawar
In today's real time world network on chip (NoC) plays a major role in fast communication between entities. The need for NoC hardware is in demand based on requirement for fast communication with large data bandwidth. In this paper, an efficient field programmable gate array (FPGA) based NoC architecture for data communication is proposed. The router is designed with 4 ports using proposed controller unit, novel first-in first-out (FIFO) architecture and XY routing logic. The proposed controller unit comprises of MUX based architecture to support the data transfer in East, West, North and South directions using respective select lines with flip-flops connected to the output of multiplexers to achieve delay synchronization. A novel FIFO architecture is designed using a counter and decision unit which are used to keep track of incoming data using signal mem_empty or mem_full. The XY routing logic is used to communicate between the routers and a test sample data is chosen to validate the routing path between source and destination using XY routing logic. The proposed routing architecture is tested on SPARTAN-6-XC6SLX45 board. It is observed that the performance parameters such as slice registers, power dissipation and maximum operating frequency are 290, 38.35 mW and 220.729 MHz respectively.
{"title":"An efficient FPGA based NoC architecture for data communication","authors":"Vijayalaxmi Jamagoud, Satish S. Bhairannawar","doi":"10.19101/IJACR.2018.838013","DOIUrl":"https://doi.org/10.19101/IJACR.2018.838013","url":null,"abstract":"In today's real time world network on chip (NoC) plays a major role in fast communication between entities. The need for NoC hardware is in demand based on requirement for fast communication with large data bandwidth. In this paper, an efficient field programmable gate array (FPGA) based NoC architecture for data communication is proposed. The router is designed with 4 ports using proposed controller unit, novel first-in first-out (FIFO) architecture and XY routing logic. The proposed controller unit comprises of MUX based architecture to support the data transfer in East, West, North and South directions using respective select lines with flip-flops connected to the output of multiplexers to achieve delay synchronization. A novel FIFO architecture is designed using a counter and decision unit which are used to keep track of incoming data using signal mem_empty or mem_full. The XY routing logic is used to communicate between the routers and a test sample data is chosen to validate the routing path between source and destination using XY routing logic. The proposed routing architecture is tested on SPARTAN-6-XC6SLX45 board. It is observed that the performance parameters such as slice registers, power dissipation and maximum operating frequency are 290, 38.35 mW and 220.729 MHz respectively.","PeriodicalId":273530,"journal":{"name":"International Journal of Advanced Computer Research","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126235517","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-11-30DOI: 10.19101/IJACR.2018.839004
Hashem A. Jabar, Rshid A. Fayadh, M. Abud
{"title":"Investigation of rain and haze attenuations impact on proposed SCM˗SAC˗OCDMA˗FSO system with optical amplifier","authors":"Hashem A. Jabar, Rshid A. Fayadh, M. Abud","doi":"10.19101/IJACR.2018.839004","DOIUrl":"https://doi.org/10.19101/IJACR.2018.839004","url":null,"abstract":"","PeriodicalId":273530,"journal":{"name":"International Journal of Advanced Computer Research","volume":"269 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133643471","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-11-30DOI: 10.19101/ijacr.2018.839002
Joseph Tarigan, A. S. Girsang
Sarcasm detection is an important task in natural language processing (NLP). Sarcasm flips the polarity of a sentence and will affect the accuracy of sentiment analysis task. Recent researches incorporate machine learning and deep learning methods to detect sarcasm. Sarcasm can be detected by the occurrence of context disparity. This feature can be detected by observing the similarity score of each word in the sentence. Word embedding vector is used to calculate word similarity score. In this work, the word similarity score is incorporated as an augmented feature in the deep learning model. Three augmenting schemes in deep learning models are observed. Results show that in general, a word similarity score boosts the performance of the classifier. The accuracy of 85.625% with F-Measure of 84.884% was achieved at its best.
{"title":"Word similarity score as augmented feature in sarcasm detection using deep learning","authors":"Joseph Tarigan, A. S. Girsang","doi":"10.19101/ijacr.2018.839002","DOIUrl":"https://doi.org/10.19101/ijacr.2018.839002","url":null,"abstract":"Sarcasm detection is an important task in natural language processing (NLP). Sarcasm flips the polarity of a sentence and will affect the accuracy of sentiment analysis task. Recent researches incorporate machine learning and deep learning methods to detect sarcasm. Sarcasm can be detected by the occurrence of context disparity. This feature can be detected by observing the similarity score of each word in the sentence. Word embedding vector is used to calculate word similarity score. In this work, the word similarity score is incorporated as an augmented feature in the deep learning model. Three augmenting schemes in deep learning models are observed. Results show that in general, a word similarity score boosts the performance of the classifier. The accuracy of 85.625% with F-Measure of 84.884% was achieved at its best.","PeriodicalId":273530,"journal":{"name":"International Journal of Advanced Computer Research","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115467559","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-28DOI: 10.19101/ijacr.2018.838014
Rawa Abed Mohammed, Fadhil S. Hassan, M. Zaiter
Efficient design and implementation of Haar wavelet packet modulation based differential chaos shift keying (HWPM DCSK) using field programmable gate array (FPGA) platform was proposed. A fast algorithm for Haar wavelet packet transform (FHWPT) was used to enhance the complexity of the wavelet packet modulation (WPM) system. The HWPM-DCSK system uses sixteen points of FHWPT and inverse fast Haar wavelet packet transform (IFHWPT) with spreading factor about eight for DCSK modulation. The suggested system was designed using a Xilinx system generator (XSG) tool. Software tools used in this work include ISE 14.5. A Virtex-4 (xc4vfx100-12ff1152) board was used for the implementation. The results are showing that the information bits are recovered successfully at the receiver side. The system was routed successfully with the resources of 5% slice flip flop, 5% look-up table (LUT), 10% occupied slices and 70% digital signal processing (DSP) 48s numbers from the selected device. The XSG is more reliable, flexible, easier, and gives the optimum design for the FPGA technicality via comparing with the conventional FPGA design. Also, the hardware simulation results show that the proposed system is efficient in performance for the real time communication system with low consuming power.
{"title":"Design and implementation of Haar wavelet packet modulation based differential chaos shift keying communication system using FPGA","authors":"Rawa Abed Mohammed, Fadhil S. Hassan, M. Zaiter","doi":"10.19101/ijacr.2018.838014","DOIUrl":"https://doi.org/10.19101/ijacr.2018.838014","url":null,"abstract":"Efficient design and implementation of Haar wavelet packet modulation based differential chaos shift keying (HWPM DCSK) using field programmable gate array (FPGA) platform was proposed. A fast algorithm for Haar wavelet packet transform (FHWPT) was used to enhance the complexity of the wavelet packet modulation (WPM) system. The HWPM-DCSK system uses sixteen points of FHWPT and inverse fast Haar wavelet packet transform (IFHWPT) with spreading factor about eight for DCSK modulation. The suggested system was designed using a Xilinx system generator (XSG) tool. Software tools used in this work include ISE 14.5. A Virtex-4 (xc4vfx100-12ff1152) board was used for the implementation. The results are showing that the information bits are recovered successfully at the receiver side. The system was routed successfully with the resources of 5% slice flip flop, 5% look-up table (LUT), 10% occupied slices and 70% digital signal processing (DSP) 48s numbers from the selected device. The XSG is more reliable, flexible, easier, and gives the optimum design for the FPGA technicality via comparing with the conventional FPGA design. Also, the hardware simulation results show that the proposed system is efficient in performance for the real time communication system with low consuming power.","PeriodicalId":273530,"journal":{"name":"International Journal of Advanced Computer Research","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125527959","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
扫码关注我们
求助内容：
应助结果提醒方式：