Pub Date : 2019-04-02DOI: 10.1109/CJECE.2019.2890833
H. Yeganeh, A. Salahi, M. Pourmina
Due to the large volume of data, high processing time, and power consumption, operators are looking for ways to reduce the energy consumption and subsequently optimize the energy consumption of data centers. Appropriate pricing of services and control of user demands along with considering renewable energy in the data center lead to a reduction in energy consumption of both users and data centers. The proposed methods for simultaneous reduction in the cost of energy consumption and an increase in the number of processed demands in data centers are not very practical. This paper proposed the capacity planning with dynamic pricing algorithm considering different factors in energy consumption reduction in green data centers of the fourth/fifth generation of mobile system networks delivering mobile cloud computing services. The proposed algorithm determines the optimal number of servers and addresses the tradeoff between the cost of operation and the delay of services. A penalty function for cost was derived and various scenarios were designed and different qualities of services were considered using the Lyapunov optimization to set up the simulation environment. The provided results illustrate the efficiency of the proposed scheme and validate the mathematical model.
{"title":"A Novel Cost Optimization Method for Mobile Cloud Computing by Capacity Planning of Green Data Center With Dynamic Pricing","authors":"H. Yeganeh, A. Salahi, M. Pourmina","doi":"10.1109/CJECE.2019.2890833","DOIUrl":"https://doi.org/10.1109/CJECE.2019.2890833","url":null,"abstract":"Due to the large volume of data, high processing time, and power consumption, operators are looking for ways to reduce the energy consumption and subsequently optimize the energy consumption of data centers. Appropriate pricing of services and control of user demands along with considering renewable energy in the data center lead to a reduction in energy consumption of both users and data centers. The proposed methods for simultaneous reduction in the cost of energy consumption and an increase in the number of processed demands in data centers are not very practical. This paper proposed the capacity planning with dynamic pricing algorithm considering different factors in energy consumption reduction in green data centers of the fourth/fifth generation of mobile system networks delivering mobile cloud computing services. The proposed algorithm determines the optimal number of servers and addresses the tradeoff between the cost of operation and the delay of services. A penalty function for cost was derived and various scenarios were designed and different qualities of services were considered using the Lyapunov optimization to set up the simulation environment. The provided results illustrate the efficiency of the proposed scheme and validate the mathematical model.","PeriodicalId":55287,"journal":{"name":"Canadian Journal of Electrical and Computer Engineering-Revue Canadienne De Genie Electrique et Informatique","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2019-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/CJECE.2019.2890833","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46718539","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 : 2019-04-02DOI: 10.1109/CJECE.2018.2885326
Hadi Tajali Zadeh, Reza Boostani
There is a growing tendency for developing real-time clustering of continuous stream data. In this regard, a few attempts have been made to improve the off-line phase of stream clustering methods, whereas these methods almost use a simple distance function in their online phase. In practice, clusters have complex shapes, and therefore, measuring the distance of incoming samples to the mean of asymmetric microclusters might mislead incoming samples to irrelevant microclusters. In this paper, a novel framework is proposed, which can enhance the online phase of all stream clustering methods. In this manner, for each microcluster for which its population exceeds a threshold, a classifier is exclusively trained to capture its boundary and statistical properties. Thus, incoming samples are assigned to the microclusters according to the classifiers⣙ scores. Here, the incremental NaÃˉve Bayes classifier is chosen, due to its fast learning property. DenStream and CluStream as the state-of-the-art methods were chosen and their performance was assessed over nine synthetic and real data sets, with and without applying the proposed framework. The comparative results in terms of purity, general recall, general precision, concept change traceability, computational complexity, and robustness against noise over the data sets imply the superiority of the modified methods to their original versions.
{"title":"A Novel Clustering Framework for Stream Data Un nouveau cadre de classifications pour les données de flux","authors":"Hadi Tajali Zadeh, Reza Boostani","doi":"10.1109/CJECE.2018.2885326","DOIUrl":"https://doi.org/10.1109/CJECE.2018.2885326","url":null,"abstract":"There is a growing tendency for developing real-time clustering of continuous stream data. In this regard, a few attempts have been made to improve the off-line phase of stream clustering methods, whereas these methods almost use a simple distance function in their online phase. In practice, clusters have complex shapes, and therefore, measuring the distance of incoming samples to the mean of asymmetric microclusters might mislead incoming samples to irrelevant microclusters. In this paper, a novel framework is proposed, which can enhance the online phase of all stream clustering methods. In this manner, for each microcluster for which its population exceeds a threshold, a classifier is exclusively trained to capture its boundary and statistical properties. Thus, incoming samples are assigned to the microclusters according to the classifiers⣙ scores. Here, the incremental NaÃˉve Bayes classifier is chosen, due to its fast learning property. DenStream and CluStream as the state-of-the-art methods were chosen and their performance was assessed over nine synthetic and real data sets, with and without applying the proposed framework. The comparative results in terms of purity, general recall, general precision, concept change traceability, computational complexity, and robustness against noise over the data sets imply the superiority of the modified methods to their original versions.","PeriodicalId":55287,"journal":{"name":"Canadian Journal of Electrical and Computer Engineering-Revue Canadienne De Genie Electrique et Informatique","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2019-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/CJECE.2018.2885326","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47834984","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 : 2019-04-02DOI: 10.1109/CJECE.2018.2885351
Yongkeun Lee, Jongkwan Kim
In this paper, the three-phase inverter power efficiency of a brushless DC (BLDC) motor drive is analyzed theoretically and verified experimentally. An inverted pulsewidth modulation driving scheme has higher power efficiency than a conventional six-step driving scheme, particularly under low rotor speed due to less diode conduction power loss of Sync metal–oxide–semiconductor field-effect transistors (MOSFETs). However, the difference in the power efficiency decreases as the rotor speed increases; for a rotor speed above 1000 r/min, the difference in the power efficiency is negligible. In addition, the power efficiency of the inverted driving scheme drops further than one for the conventional six-step driving scheme with sampling frequency increase. It is due to the additional switching power loss of Sync MOSFET. The theoretical analysis of power loss in a three-phase inverter verifies the experimental results.
{"title":"Analysis of the Three-Phase Inverter Power Efficiency of a BLDC Motor Drive Using Conventional Six-Step and Inverted Pulsewidth Modulation Driving Schemes","authors":"Yongkeun Lee, Jongkwan Kim","doi":"10.1109/CJECE.2018.2885351","DOIUrl":"https://doi.org/10.1109/CJECE.2018.2885351","url":null,"abstract":"In this paper, the three-phase inverter power efficiency of a brushless DC (BLDC) motor drive is analyzed theoretically and verified experimentally. An inverted pulsewidth modulation driving scheme has higher power efficiency than a conventional six-step driving scheme, particularly under low rotor speed due to less diode conduction power loss of Sync metal–oxide–semiconductor field-effect transistors (MOSFETs). However, the difference in the power efficiency decreases as the rotor speed increases; for a rotor speed above 1000 r/min, the difference in the power efficiency is negligible. In addition, the power efficiency of the inverted driving scheme drops further than one for the conventional six-step driving scheme with sampling frequency increase. It is due to the additional switching power loss of Sync MOSFET. The theoretical analysis of power loss in a three-phase inverter verifies the experimental results.","PeriodicalId":55287,"journal":{"name":"Canadian Journal of Electrical and Computer Engineering-Revue Canadienne De Genie Electrique et Informatique","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2019-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/CJECE.2018.2885351","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41897351","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 : 2019-04-01DOI: 10.1109/CJECE.2018.2878321
M. Awadallah, B. Venkatesh
It is no exaggeration to state that power systems presently undergo a paradigm shift. Driven by an urgent desire to mitigate the effects of global warming and a foreseen end to the world’s fossil fuel resources, an increasing tendency toward renewable energies is fostered by the international community. On the other hand, distributed generation and electric vehicle adoption are altering load nature and profile. Therefore, energy storage (ES) becomes a necessity for its ability to bridge the gap between the dynamically changing supply and demand in addition to other ancillary services it can provide. Meanwhile, advances in smart grid technologies enable escalating the incorporation of new technologies with more efficient control schemes and energy management algorithms. This paper presents an overview on the employment of ES technologies in planning and operation of distribution systems through the literature survey. The problem of sizing and siting ES units in distribution systems is first introduced. The state of the art of the technology is summarized, and some outstanding issues to be addressed through future research are highlighted.
{"title":"Energy Storage in Distribution System Planning and Operation: Current Status and Outstanding Challenges","authors":"M. Awadallah, B. Venkatesh","doi":"10.1109/CJECE.2018.2878321","DOIUrl":"https://doi.org/10.1109/CJECE.2018.2878321","url":null,"abstract":"It is no exaggeration to state that power systems presently undergo a paradigm shift. Driven by an urgent desire to mitigate the effects of global warming and a foreseen end to the world’s fossil fuel resources, an increasing tendency toward renewable energies is fostered by the international community. On the other hand, distributed generation and electric vehicle adoption are altering load nature and profile. Therefore, energy storage (ES) becomes a necessity for its ability to bridge the gap between the dynamically changing supply and demand in addition to other ancillary services it can provide. Meanwhile, advances in smart grid technologies enable escalating the incorporation of new technologies with more efficient control schemes and energy management algorithms. This paper presents an overview on the employment of ES technologies in planning and operation of distribution systems through the literature survey. The problem of sizing and siting ES units in distribution systems is first introduced. The state of the art of the technology is summarized, and some outstanding issues to be addressed through future research are highlighted.","PeriodicalId":55287,"journal":{"name":"Canadian Journal of Electrical and Computer Engineering-Revue Canadienne De Genie Electrique et Informatique","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/CJECE.2018.2878321","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49614391","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 : 2019-01-01DOI: 10.1109/cjece.2019.2900087
Atef Ibrahim
In this paper, we present efficient parallel and serial systolic structures for combined multiplication and squaring over GF( ${2^{m}}$ ). The proposed structures have the advantage of computing both modular multiplication and squaring simultaneously for fast execution of modular exponentiation. They share the same hardware components for both operations and this gives them the advantage of saving more space than the case of using a separate structure for each operation. In addition, they have a regular structure and local communication between the processing elements and this makes them more efficient for VLSI implementation. Complexity analysis of the proposed designs and the existing most recent and efficient designs indicates that the proposed serial design has 31.7% lower area-time (AT) complexity than the previously reported most recent serial one. In addition, the proposed parallel design has a significant lower AT complexity over the recent efficient parallel designs by at least 96.9%.
{"title":"Efficient Parallel and Serial Systolic Structures for Multiplication and Squaring Over GF( ${2^{m}}$ )","authors":"Atef Ibrahim","doi":"10.1109/cjece.2019.2900087","DOIUrl":"https://doi.org/10.1109/cjece.2019.2900087","url":null,"abstract":"In this paper, we present efficient parallel and serial systolic structures for combined multiplication and squaring over GF( ${2^{m}}$ ). The proposed structures have the advantage of computing both modular multiplication and squaring simultaneously for fast execution of modular exponentiation. They share the same hardware components for both operations and this gives them the advantage of saving more space than the case of using a separate structure for each operation. In addition, they have a regular structure and local communication between the processing elements and this makes them more efficient for VLSI implementation. Complexity analysis of the proposed designs and the existing most recent and efficient designs indicates that the proposed serial design has 31.7% lower area-time (AT) complexity than the previously reported most recent serial one. In addition, the proposed parallel design has a significant lower AT complexity over the recent efficient parallel designs by at least 96.9%.","PeriodicalId":55287,"journal":{"name":"Canadian Journal of Electrical and Computer Engineering-Revue Canadienne De Genie Electrique et Informatique","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/cjece.2019.2900087","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"62193136","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 : 2019-01-01DOI: 10.1109/CJECE.2019.2897624
Deepak Kachave, A. Sengupta
Fault due to the single-event transient (SET) on digital signal processing (DSP) cores has not been thoroughly studied in the research community. Moreover, as the technology scaling becomes more intense, the impact of transient fault now becomes visible both in temporal and spatial domains. Few techniques have been presented in the literature that simultaneously address temporal and the spatial effects of transient fault. However, none of these approaches consider the omnidirectional spatial propagation of transient fault. Furthermore, these approaches have failed to consider the impact of transient fault on switching elements. This calls for methodology to tackle both the temporal and omnidirectional spatial effects of the transient fault on DSP cores. The proposed approach tackles these issues and presents a novel methodology to generate a low-cost fault-tolerant DSP core datapath against temporal (kc-cycle) and omnidirectional spatial (km-unit) impacts of SET.
{"title":"Fault-Tolerant DSP Core Datapath Against Omnidirectional Spatial Impact of SET","authors":"Deepak Kachave, A. Sengupta","doi":"10.1109/CJECE.2019.2897624","DOIUrl":"https://doi.org/10.1109/CJECE.2019.2897624","url":null,"abstract":"Fault due to the single-event transient (SET) on digital signal processing (DSP) cores has not been thoroughly studied in the research community. Moreover, as the technology scaling becomes more intense, the impact of transient fault now becomes visible both in temporal and spatial domains. Few techniques have been presented in the literature that simultaneously address temporal and the spatial effects of transient fault. However, none of these approaches consider the omnidirectional spatial propagation of transient fault. Furthermore, these approaches have failed to consider the impact of transient fault on switching elements. This calls for methodology to tackle both the temporal and omnidirectional spatial effects of the transient fault on DSP cores. The proposed approach tackles these issues and presents a novel methodology to generate a low-cost fault-tolerant DSP core datapath against temporal (kc-cycle) and omnidirectional spatial (km-unit) impacts of SET.","PeriodicalId":55287,"journal":{"name":"Canadian Journal of Electrical and Computer Engineering-Revue Canadienne De Genie Electrique et Informatique","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/CJECE.2019.2897624","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"62193061","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 : 2019-01-01DOI: 10.1109/CJECE.2019.2904983
M. Effati, K. Skonieczny
This paper addresses the minimization of the risk of wheel slippage for a popular class of rovers. In the absence of any constraints on the system (e.g., force/torque balance and maximum motor torques), the optimal traction solution is known to be that with equal “friction requirements” (ratios of tractive to normal force) for all wheels. Nevertheless, the current state of the art is to routinely perform computationally expensive constrained optimization because of the presumed importance of the constraints in a real system. The contribution of this paper is a thorough investigation of the configuration space for four-wheel rovers, driving straight over rough terrain, in search of configurations where the unconstrained optimal answer does or does not satisfy the constraints, and, thus, is or is not valid. Equal “friction requirements” are added to the four-wheel rover’s system of quasi-static equations and a valid solution is sought to this augmented system of equations. It is found that the equal “friction requirements” solution is almost always valid, except for the case where two of the wheels are wedged against opposing vertical faces, a highly unusual and unlikely scenario. Therefore, we can conclude that computationally expensive constrained optimization is not required to achieve traction control for four-wheel rovers.
{"title":"Optimal Traction Forces for Four-Wheel Rovers on Rough Terrain","authors":"M. Effati, K. Skonieczny","doi":"10.1109/CJECE.2019.2904983","DOIUrl":"https://doi.org/10.1109/CJECE.2019.2904983","url":null,"abstract":"This paper addresses the minimization of the risk of wheel slippage for a popular class of rovers. In the absence of any constraints on the system (e.g., force/torque balance and maximum motor torques), the optimal traction solution is known to be that with equal “friction requirements” (ratios of tractive to normal force) for all wheels. Nevertheless, the current state of the art is to routinely perform computationally expensive constrained optimization because of the presumed importance of the constraints in a real system. The contribution of this paper is a thorough investigation of the configuration space for four-wheel rovers, driving straight over rough terrain, in search of configurations where the unconstrained optimal answer does or does not satisfy the constraints, and, thus, is or is not valid. Equal “friction requirements” are added to the four-wheel rover’s system of quasi-static equations and a valid solution is sought to this augmented system of equations. It is found that the equal “friction requirements” solution is almost always valid, except for the case where two of the wheels are wedged against opposing vertical faces, a highly unusual and unlikely scenario. Therefore, we can conclude that computationally expensive constrained optimization is not required to achieve traction control for four-wheel rovers.","PeriodicalId":55287,"journal":{"name":"Canadian Journal of Electrical and Computer Engineering-Revue Canadienne De Genie Electrique et Informatique","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/CJECE.2019.2904983","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"62193206","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 : 2019-01-01DOI: 10.1109/CJECE.2019.2898260
Meisam Nazariani, A. Barforoush
Crowdsourcing is a paradigm that utilizes human intelligence to solve problems that computers cannot yet solve. However, the introduction of human intelligence into computations has also resulted in new challenges in quality control. These challenges originate from the malicious behaviors of crowd workers. Malicious workers are workers with hidden motives, who either simply sabotage a task or provide arbitrary responses to attain some monetary compensation. Recently, many studies have tried to detect and reduce the impact of malicious workers. The mechanisms vary from using ground truth to peer review by experts. Although the use of such mechanisms may increase the overall quality of outputs, it also imposes overhead costs in terms of money and/or time, with such costs being often remarkable and contradictory to the philosophy of crowdsourcing. In this paper, a novel dynamic weighted majority method is introduced to detect malicious workers based on a new malicious metric. Effectiveness of the proposed methodology is then showed by presenting the experimental results.
{"title":"Dynamic Weighted Majority Approach for Detecting Malicious Crowd Workers","authors":"Meisam Nazariani, A. Barforoush","doi":"10.1109/CJECE.2019.2898260","DOIUrl":"https://doi.org/10.1109/CJECE.2019.2898260","url":null,"abstract":"Crowdsourcing is a paradigm that utilizes human intelligence to solve problems that computers cannot yet solve. However, the introduction of human intelligence into computations has also resulted in new challenges in quality control. These challenges originate from the malicious behaviors of crowd workers. Malicious workers are workers with hidden motives, who either simply sabotage a task or provide arbitrary responses to attain some monetary compensation. Recently, many studies have tried to detect and reduce the impact of malicious workers. The mechanisms vary from using ground truth to peer review by experts. Although the use of such mechanisms may increase the overall quality of outputs, it also imposes overhead costs in terms of money and/or time, with such costs being often remarkable and contradictory to the philosophy of crowdsourcing. In this paper, a novel dynamic weighted majority method is introduced to detect malicious workers based on a new malicious metric. Effectiveness of the proposed methodology is then showed by presenting the experimental results.","PeriodicalId":55287,"journal":{"name":"Canadian Journal of Electrical and Computer Engineering-Revue Canadienne De Genie Electrique et Informatique","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/CJECE.2019.2898260","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"62193076","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-07DOI: 10.1109/CJECE.2018.2871130
Majid Farahmand, A. Mohammadi
In this paper, the optimization of energy efficiency (EE) and the improvement of user data rate in cloud radio access networks (C-RANs) are studied by introducing a weighted sparse beamforming (WSB) method. Using stochastic geometry tools, analytical expressions are derived to describe downlink ergodic rate and coverage probability for coordination multipoint joint transmission in C-RAN. Based on these expressions and by taking advantage of central processing and coordination in baseband unit pool, power allocation among remote radio heads is optimized using the WSB. The WSB optimization algorithm is based on water-filling power allocation strategy and redistributing the power among RRHs. The improvement in both EE and ergodic rate is achieved. The improvement in EE is pronounced up to 28% using WSB technique compare to the equal power beamforming method in the proposed C-RAN network.
{"title":"Energy-Efficient Sparse Beamforming in Cloud Radio Access Networks","authors":"Majid Farahmand, A. Mohammadi","doi":"10.1109/CJECE.2018.2871130","DOIUrl":"https://doi.org/10.1109/CJECE.2018.2871130","url":null,"abstract":"In this paper, the optimization of energy efficiency (EE) and the improvement of user data rate in cloud radio access networks (C-RANs) are studied by introducing a weighted sparse beamforming (WSB) method. Using stochastic geometry tools, analytical expressions are derived to describe downlink ergodic rate and coverage probability for coordination multipoint joint transmission in C-RAN. Based on these expressions and by taking advantage of central processing and coordination in baseband unit pool, power allocation among remote radio heads is optimized using the WSB. The WSB optimization algorithm is based on water-filling power allocation strategy and redistributing the power among RRHs. The improvement in both EE and ergodic rate is achieved. The improvement in EE is pronounced up to 28% using WSB technique compare to the equal power beamforming method in the proposed C-RAN network.","PeriodicalId":55287,"journal":{"name":"Canadian Journal of Electrical and Computer Engineering-Revue Canadienne De Genie Electrique et Informatique","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2018-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/CJECE.2018.2871130","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41613740","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-07DOI: 10.1109/CJECE.2018.2867591
Dingding Yang, Hongbo Zhou, Liming Tang, Shiqiang Chen, Song Liu
License plates intelligent identification systems must be able to correct the tilt of a license plate in an image. Aiming at improving on the low tilt accuracy, complex algorithms, and weak robustness against noise of existing tilt correction methods, we proposed an algorithm based on the character median line. The license plate image is first preprocessed, and a projection method is applied to find and segment the character region, resulting in a license plate with no border. For the no border license plate image, we then fix x-coordinates, and find the maximum and minimum values of y-coordinates, and put them into a matrix. The next step is to obtain the mean value of the maximum and minimum values of y, obtain the point sets on the character median line of the license plate, and remove the singular points using a threshold. Finally, a straight line is fitted using the least-squares method, and the tilt angle is obtained by applying a formula for the slope and the angle. For a tilted and damaged license plate, experiments show that the proposed algorithm is simple, has a low error ratio, and has good robustness against noise and deformation.
{"title":"A License Plate Tilt Correction Algorithm Based on the Character Median Line Algorithme de correction d’inclinaison de plaque d’immatriculation basé sur la ligne médiane du caractère","authors":"Dingding Yang, Hongbo Zhou, Liming Tang, Shiqiang Chen, Song Liu","doi":"10.1109/CJECE.2018.2867591","DOIUrl":"https://doi.org/10.1109/CJECE.2018.2867591","url":null,"abstract":"License plates intelligent identification systems must be able to correct the tilt of a license plate in an image. Aiming at improving on the low tilt accuracy, complex algorithms, and weak robustness against noise of existing tilt correction methods, we proposed an algorithm based on the character median line. The license plate image is first preprocessed, and a projection method is applied to find and segment the character region, resulting in a license plate with no border. For the no border license plate image, we then fix x-coordinates, and find the maximum and minimum values of y-coordinates, and put them into a matrix. The next step is to obtain the mean value of the maximum and minimum values of y, obtain the point sets on the character median line of the license plate, and remove the singular points using a threshold. Finally, a straight line is fitted using the least-squares method, and the tilt angle is obtained by applying a formula for the slope and the angle. For a tilted and damaged license plate, experiments show that the proposed algorithm is simple, has a low error ratio, and has good robustness against noise and deformation.","PeriodicalId":55287,"journal":{"name":"Canadian Journal of Electrical and Computer Engineering-Revue Canadienne De Genie Electrique et Informatique","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2018-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/CJECE.2018.2867591","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42820410","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
扫码关注我们
求助内容：
应助结果提醒方式：