Pub Date : 2018-02-01DOI: 10.23919/ICACT.2018.8323659
W. Lee, K. Tsang
The important characteristics of a mixer including high conversion gain, low noise, high dynamic range, low third-order intermodulation distortion and low unwanted leakage signals between ports have reconsidered. A double balanced Gilbert-cell with a class-A amplifier bleeding mixer (DBGC CAAB mixer) is designed and implemented. The voltage gain of 14 dB at class-A amplifier is used to magnifier the local oscillator (LO) signal. Current of class-A amplifier is injected into the Gibert mixer as a bleeding current to improve the performance of the trans-conductor stage. The DBGC CAAB mixer achieves a conversion gain of 17.5 dB at −14 dBm LO power, and the noise figure is suppressed from 45 dB to 10.7 dB. It is important to stress that the new configuration has a third-order intermodulation (HP3) at −9 dBm which is considered to be insignificant. The DBGC CAAB mixer is implemented by using 0.18-μm RFCMOS technology and operates at the 2.4 GHz ISM application with 10 MHz intermediate frequency. The power consumption is 12 mA at 1.5 V supply voltage.
{"title":"Design of a 2.4 GHz high-performance mixer with current bleeding topology","authors":"W. Lee, K. Tsang","doi":"10.23919/ICACT.2018.8323659","DOIUrl":"https://doi.org/10.23919/ICACT.2018.8323659","url":null,"abstract":"The important characteristics of a mixer including high conversion gain, low noise, high dynamic range, low third-order intermodulation distortion and low unwanted leakage signals between ports have reconsidered. A double balanced Gilbert-cell with a class-A amplifier bleeding mixer (DBGC CAAB mixer) is designed and implemented. The voltage gain of 14 dB at class-A amplifier is used to magnifier the local oscillator (LO) signal. Current of class-A amplifier is injected into the Gibert mixer as a bleeding current to improve the performance of the trans-conductor stage. The DBGC CAAB mixer achieves a conversion gain of 17.5 dB at −14 dBm LO power, and the noise figure is suppressed from 45 dB to 10.7 dB. It is important to stress that the new configuration has a third-order intermodulation (HP3) at −9 dBm which is considered to be insignificant. The DBGC CAAB mixer is implemented by using 0.18-μm RFCMOS technology and operates at the 2.4 GHz ISM application with 10 MHz intermediate frequency. The power consumption is 12 mA at 1.5 V supply voltage.","PeriodicalId":228625,"journal":{"name":"2018 20th International Conference on Advanced Communication Technology (ICACT)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131625634","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-02-01DOI: 10.23919/ICACT.2018.8323721
Jong-Beom Kim, Hyeon Yang, Kyeong Ho Park, S. Lee, S. Choi
In this paper, we present how to store the session information from the Heartbeat signal, which is generated at regular intervals during the network session, in real packet analysis tools. Since the existing session information retrieval method checks the session information at the end of the session, information cannot be confirmed in the case of an active session. To verify the information of the active session, this paper utilizes the heartbeat signal generated by the session every certain period. By analyzing active session information, it is possible to analyze information about flows and packets in a session in real time.
{"title":"The real-time session inspection method using heartbeat signal","authors":"Jong-Beom Kim, Hyeon Yang, Kyeong Ho Park, S. Lee, S. Choi","doi":"10.23919/ICACT.2018.8323721","DOIUrl":"https://doi.org/10.23919/ICACT.2018.8323721","url":null,"abstract":"In this paper, we present how to store the session information from the Heartbeat signal, which is generated at regular intervals during the network session, in real packet analysis tools. Since the existing session information retrieval method checks the session information at the end of the session, information cannot be confirmed in the case of an active session. To verify the information of the active session, this paper utilizes the heartbeat signal generated by the session every certain period. By analyzing active session information, it is possible to analyze information about flows and packets in a session in real time.","PeriodicalId":228625,"journal":{"name":"2018 20th International Conference on Advanced Communication Technology (ICACT)","volume":"76 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133932112","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-02-01DOI: 10.23919/ICACT.2018.8323855
Law Foo Kui, M. R. Uddin
In this paper, we demonstrated an optical D-type flip-flop based on the electro optic switching effect of silicon microring resonator. The operation of the flip flop has been verified by simulation using a clock signal of 10 Gbps and data signal of 1 Gbps. The results of the proposed flip-flop have been presented by the timing diagrams.
{"title":"Demonstration of digital optical D flip flop based on photonic micro-ring resonator","authors":"Law Foo Kui, M. R. Uddin","doi":"10.23919/ICACT.2018.8323855","DOIUrl":"https://doi.org/10.23919/ICACT.2018.8323855","url":null,"abstract":"In this paper, we demonstrated an optical D-type flip-flop based on the electro optic switching effect of silicon microring resonator. The operation of the flip flop has been verified by simulation using a clock signal of 10 Gbps and data signal of 1 Gbps. The results of the proposed flip-flop have been presented by the timing diagrams.","PeriodicalId":228625,"journal":{"name":"2018 20th International Conference on Advanced Communication Technology (ICACT)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114411274","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-02-01DOI: 10.23919/ICACT.2018.8323697
Wenkang Chen
Distributed online transaction processing (OLTP) database management systems (DBMS) are characterized with ACID properties, that is atomicity, consistency, isolation, durability. However, these OLTP DBMSs that handle massive data schema, need to be scalable that cannot give up strong transactional and consistency requirements. The large-scale schemas are deployed on distributed server and each server's memory is limited, in that case, how this system partition is the key factor to affect its performance. In this paper, we present a partition approach, that applies to general schema and taking care of load balancing and distributed transaction rates. Our method achieve this by periodically update the partition plan and migration hot data among the servers. OLTP workload are modeled as a graph and using a graph partition algorithm to partition set of data into same server that are often co-accessed by one transaction. To evaluate our method, our framework Assort is integrated into a distributed, main-memory DBMS and shows that it can partition schema in OLTP DBMS and enable the system to outperformance traditional method 3–4x throughput.
{"title":"Efficient partitioner for distributed OLTP DBMS","authors":"Wenkang Chen","doi":"10.23919/ICACT.2018.8323697","DOIUrl":"https://doi.org/10.23919/ICACT.2018.8323697","url":null,"abstract":"Distributed online transaction processing (OLTP) database management systems (DBMS) are characterized with ACID properties, that is atomicity, consistency, isolation, durability. However, these OLTP DBMSs that handle massive data schema, need to be scalable that cannot give up strong transactional and consistency requirements. The large-scale schemas are deployed on distributed server and each server's memory is limited, in that case, how this system partition is the key factor to affect its performance. In this paper, we present a partition approach, that applies to general schema and taking care of load balancing and distributed transaction rates. Our method achieve this by periodically update the partition plan and migration hot data among the servers. OLTP workload are modeled as a graph and using a graph partition algorithm to partition set of data into same server that are often co-accessed by one transaction. To evaluate our method, our framework Assort is integrated into a distributed, main-memory DBMS and shows that it can partition schema in OLTP DBMS and enable the system to outperformance traditional method 3–4x throughput.","PeriodicalId":228625,"journal":{"name":"2018 20th International Conference on Advanced Communication Technology (ICACT)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116957923","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-02-01DOI: 10.23919/ICACT.2018.8323707
Liu Liu, Ke Zhang, C. Tao, Kun Zhang, Ze Yuan, Jianhua Zhang
There is tremendous hype around the Internet of Things, and particularly in the industrial realm (the industrial Internet of Things, IIoT), where many expect to find the biggest opportunity in the near term. The IIoT is also an important application in the fifth generation of wireless communications. In this paper, the channel propagations are investigated based on the realistic measurement data in an automobile factory. The path loss model is extracted using Least Square (LS) method, and the K factor is also parameterized. Meanwhile, the time delay (root mean squared delay) and the amount of multipath component (MPC)s are investigated and compared with typical propagation results. These results are beneficial and informative when designing wireless networks for IIoT.
{"title":"Channel measurements and characterizations for automobile factory environments","authors":"Liu Liu, Ke Zhang, C. Tao, Kun Zhang, Ze Yuan, Jianhua Zhang","doi":"10.23919/ICACT.2018.8323707","DOIUrl":"https://doi.org/10.23919/ICACT.2018.8323707","url":null,"abstract":"There is tremendous hype around the Internet of Things, and particularly in the industrial realm (the industrial Internet of Things, IIoT), where many expect to find the biggest opportunity in the near term. The IIoT is also an important application in the fifth generation of wireless communications. In this paper, the channel propagations are investigated based on the realistic measurement data in an automobile factory. The path loss model is extracted using Least Square (LS) method, and the K factor is also parameterized. Meanwhile, the time delay (root mean squared delay) and the amount of multipath component (MPC)s are investigated and compared with typical propagation results. These results are beneficial and informative when designing wireless networks for IIoT.","PeriodicalId":228625,"journal":{"name":"2018 20th International Conference on Advanced Communication Technology (ICACT)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115762643","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-02-01DOI: 10.23919/ICACT.2018.8323913
O. Wojuola
Spread-spectrum system is a well-researched topic in literature. However, the system loading capacity with respect to its spreading codes is not well known. In this paper, a technique for determining the loading capacity is developed by the author. The concept of cross-correlation index is first introduced for the codes. Using this concept, a technique for predicting the system loading capacity is then developed for a set of Gold codes. This work involves the proposal of a mathematical model for the cross-correlation index, and the use of the same for the prediction of the loading capacity and system bit-error-rate performance. The model was tested for various set of Gold codes. Results for a set of 255-chip Gold codes are presented here. The results show that the codes have the capacity to support a maximum of about 15 users, above which bit-error-rate increases rapidly, ultimately resulting in emergence of error floor. The point at which the cross-correlation index equals to auto-correlation index marks the turning point around which the system performance revolves.
{"title":"Cross-correlation index and multiple-access performance of Gold codes in a spread-spectrum system","authors":"O. Wojuola","doi":"10.23919/ICACT.2018.8323913","DOIUrl":"https://doi.org/10.23919/ICACT.2018.8323913","url":null,"abstract":"Spread-spectrum system is a well-researched topic in literature. However, the system loading capacity with respect to its spreading codes is not well known. In this paper, a technique for determining the loading capacity is developed by the author. The concept of cross-correlation index is first introduced for the codes. Using this concept, a technique for predicting the system loading capacity is then developed for a set of Gold codes. This work involves the proposal of a mathematical model for the cross-correlation index, and the use of the same for the prediction of the loading capacity and system bit-error-rate performance. The model was tested for various set of Gold codes. Results for a set of 255-chip Gold codes are presented here. The results show that the codes have the capacity to support a maximum of about 15 users, above which bit-error-rate increases rapidly, ultimately resulting in emergence of error floor. The point at which the cross-correlation index equals to auto-correlation index marks the turning point around which the system performance revolves.","PeriodicalId":228625,"journal":{"name":"2018 20th International Conference on Advanced Communication Technology (ICACT)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124937948","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-02-01DOI: 10.23919/ICACT.2018.8323867
Shahab Rezaian, Harhodin Bin Salamat, R. Malekzadeh, Rasimah Chemohd Yusoff, N. Zare
There is little data on the Iranian nurses' level of satisfaction with Hospital Information System implementation in university hospitals. The aims of this study were:1) To determine the reliability and validity of factors which can affect the successful implementation of Hospital Information System for nursing staff 2) and use them to propose a new implementation success model.
{"title":"Factors affecting the successful implementation of hospital information system: A preliminary pilot study of Iranian nurses","authors":"Shahab Rezaian, Harhodin Bin Salamat, R. Malekzadeh, Rasimah Chemohd Yusoff, N. Zare","doi":"10.23919/ICACT.2018.8323867","DOIUrl":"https://doi.org/10.23919/ICACT.2018.8323867","url":null,"abstract":"There is little data on the Iranian nurses' level of satisfaction with Hospital Information System implementation in university hospitals. The aims of this study were:1) To determine the reliability and validity of factors which can affect the successful implementation of Hospital Information System for nursing staff 2) and use them to propose a new implementation success model.","PeriodicalId":228625,"journal":{"name":"2018 20th International Conference on Advanced Communication Technology (ICACT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123504506","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}
Cyber-attacks are likely to continue to increase in size and frequency. As attackers get smarter than before, so do efforts made to protect against unwanted data theft. The purpose of this paper is to look for unusual patterns by repeatable experiments among the constant buzz of network packets that make up PT activities. The utilization of different PT toolkits, like Winfingerprint, Superscan, Nmap, SoftPerfect Network Scanner, NeoTrace, Nessus Vulnerability Scanner, and Path Analyzer Pro, facilitates cyber-attackers to bring down online system. It is capable of discerning network traffic on the vast streams of network information available through the connected machines from the following three phases: data collection, data reduction, and data analysis. Network forensics can aid in detecting attack behavior. This paper accommodates real-time evidence collection as a network feature against attackers. The identification of unusual patterns in network packets has been put to use in the ongoing battle to stay one step ahead of malicious hackers, who could be anyone from disgruntled customers to nation states. This approach can be easily deployed and should be applicable to any type of network-based assessment.
{"title":"Forensic analysis of network packets from penetration test toolkits","authors":"Da-Yu Kao, Yu-Siang Wang, Fuching Tsai, Chien-Hung Chen","doi":"10.23919/ICACT.2018.8323757","DOIUrl":"https://doi.org/10.23919/ICACT.2018.8323757","url":null,"abstract":"Cyber-attacks are likely to continue to increase in size and frequency. As attackers get smarter than before, so do efforts made to protect against unwanted data theft. The purpose of this paper is to look for unusual patterns by repeatable experiments among the constant buzz of network packets that make up PT activities. The utilization of different PT toolkits, like Winfingerprint, Superscan, Nmap, SoftPerfect Network Scanner, NeoTrace, Nessus Vulnerability Scanner, and Path Analyzer Pro, facilitates cyber-attackers to bring down online system. It is capable of discerning network traffic on the vast streams of network information available through the connected machines from the following three phases: data collection, data reduction, and data analysis. Network forensics can aid in detecting attack behavior. This paper accommodates real-time evidence collection as a network feature against attackers. The identification of unusual patterns in network packets has been put to use in the ongoing battle to stay one step ahead of malicious hackers, who could be anyone from disgruntled customers to nation states. This approach can be easily deployed and should be applicable to any type of network-based assessment.","PeriodicalId":228625,"journal":{"name":"2018 20th International Conference on Advanced Communication Technology (ICACT)","volume":"59 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124277530","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-02-01DOI: 10.23919/ICACT.2018.8323689
Yu Chen, Mingming Sun
The event-driven programming model has been proposed to efficiently process iterative applications and incremental applications. In clusters based the event-driven model, applications are structured as a series of short triggers, each of which will be invoked when associate events are trigged. And framework assigns a newly submitted trigger to a node where the relevant datasets set. Unfortunately it may lead to load imbalance because associate events may occur by chance. Numerous triggers in a node may be simultaneously invoked but other nodes have no triggers running. To the end, we provide TSSA, a new two steps event-driven for the event-driven clusters to maximize improve the utilization of node resources. Our results indicate TSSA performs well, and minimizes total execution time of applications.
{"title":"TSSA: A two step scheduling algorithm for the event-driven clusters","authors":"Yu Chen, Mingming Sun","doi":"10.23919/ICACT.2018.8323689","DOIUrl":"https://doi.org/10.23919/ICACT.2018.8323689","url":null,"abstract":"The event-driven programming model has been proposed to efficiently process iterative applications and incremental applications. In clusters based the event-driven model, applications are structured as a series of short triggers, each of which will be invoked when associate events are trigged. And framework assigns a newly submitted trigger to a node where the relevant datasets set. Unfortunately it may lead to load imbalance because associate events may occur by chance. Numerous triggers in a node may be simultaneously invoked but other nodes have no triggers running. To the end, we provide TSSA, a new two steps event-driven for the event-driven clusters to maximize improve the utilization of node resources. Our results indicate TSSA performs well, and minimizes total execution time of applications.","PeriodicalId":228625,"journal":{"name":"2018 20th International Conference on Advanced Communication Technology (ICACT)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129549700","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-02-01DOI: 10.23919/ICACT.2018.8323623
Panya Jirajaracheep, Sunisa Sanpan, Pornpawit Boonsrimuang, P. Boonsrimuang
The filter Bank Multicarrier (FBMC) modulation with offset-QAM (OQAM) has attracted attention as a major candidate for future wireless communication systems which has several advantages. A disadvantage of FBMC-OQAM is high peak-to-average power ratio (PAPR). To overcome this problem, the trellis-based SLM technique is employed and achieved a much better PAPR reduction performance. However, The Trellis-based algorithm has also the intrinsic disadvantage of high computational complexity, to decreasing the complexity will make the system more desirable. This paper proposes the half-complexity algorithm for trellis-based SLM scheme which achieves lower computational complexity when compared to trellis-based SLM scheme with small degradation of PAPR reduction performance. From various simulation results, the proposed algorithm shows less computational complexity about 50% compared to the trellis-based algorithm with similar PAPR reduction performance.
{"title":"PAPR reduction in FBMC-OQAM signals with half complexity of trellis-based SLM","authors":"Panya Jirajaracheep, Sunisa Sanpan, Pornpawit Boonsrimuang, P. Boonsrimuang","doi":"10.23919/ICACT.2018.8323623","DOIUrl":"https://doi.org/10.23919/ICACT.2018.8323623","url":null,"abstract":"The filter Bank Multicarrier (FBMC) modulation with offset-QAM (OQAM) has attracted attention as a major candidate for future wireless communication systems which has several advantages. A disadvantage of FBMC-OQAM is high peak-to-average power ratio (PAPR). To overcome this problem, the trellis-based SLM technique is employed and achieved a much better PAPR reduction performance. However, The Trellis-based algorithm has also the intrinsic disadvantage of high computational complexity, to decreasing the complexity will make the system more desirable. This paper proposes the half-complexity algorithm for trellis-based SLM scheme which achieves lower computational complexity when compared to trellis-based SLM scheme with small degradation of PAPR reduction performance. From various simulation results, the proposed algorithm shows less computational complexity about 50% compared to the trellis-based algorithm with similar PAPR reduction performance.","PeriodicalId":228625,"journal":{"name":"2018 20th International Conference on Advanced Communication Technology (ICACT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129594530","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
扫码关注我们
求助内容：
应助结果提醒方式：