Pub Date : 2014-12-01DOI: 10.1109/ICHPCA.2014.7045351
Satrajit Ghosh, Biswanath Sen, R. Das
Reversible Computation is of interest, because it is associated with ultra low power computing. Design and analysis of a reversible sequential circuit is an interesting research problem. State of the art design decomposes a sequential circuit into smaller modules. Then each module is implemented using known reversible circuits like Toffoli Gate, Peres Gate, Fredkin Gate, Picton Gate, and Rice Gate. This approach is inherently intractable in nature. In this work a more efficient approach is proposed that performs a detail analysis of the State Diagram. Redundancy in a state diagram arises if a “next-state” is attained from more than one “present state”. Irredundant description of such a state diagram is possible, if each state is encoded with a binary number and some ancillary bits are used to distinguish the “identical states”. This is helpful in designing a complex system that involves complex interconnection of a large number of sequential circuits.
{"title":"Bijective mapping of arbitrary finite state machine","authors":"Satrajit Ghosh, Biswanath Sen, R. Das","doi":"10.1109/ICHPCA.2014.7045351","DOIUrl":"https://doi.org/10.1109/ICHPCA.2014.7045351","url":null,"abstract":"Reversible Computation is of interest, because it is associated with ultra low power computing. Design and analysis of a reversible sequential circuit is an interesting research problem. State of the art design decomposes a sequential circuit into smaller modules. Then each module is implemented using known reversible circuits like Toffoli Gate, Peres Gate, Fredkin Gate, Picton Gate, and Rice Gate. This approach is inherently intractable in nature. In this work a more efficient approach is proposed that performs a detail analysis of the State Diagram. Redundancy in a state diagram arises if a “next-state” is attained from more than one “present state”. Irredundant description of such a state diagram is possible, if each state is encoded with a binary number and some ancillary bits are used to distinguish the “identical states”. This is helpful in designing a complex system that involves complex interconnection of a large number of sequential circuits.","PeriodicalId":197528,"journal":{"name":"2014 International Conference on High Performance Computing and Applications (ICHPCA)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114646544","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 : 2014-12-01DOI: 10.1109/ICHPCA.2014.7045362
S. K. Mohapatra, B. Dash
This paper describes the power system stability enhancement in Static Var Compensator (SVC) based damping controller. Here Proportional Integral Derivative (PID) and Lead-Lag (LL) controllers with associated time delay are considered for the proposed study. To find out the optimal controller parameters, Differential evolution algorithm is applied. The performance of the given controller is analysed under different disturbances for single machine infinite bus power system. To effectiveness and robustness of the proposed controllers, the various simulation results are compared under various disturbances and operating conditions.
{"title":"Stability enhancement in SVC based controller design using Differential Evolution algorithm","authors":"S. K. Mohapatra, B. Dash","doi":"10.1109/ICHPCA.2014.7045362","DOIUrl":"https://doi.org/10.1109/ICHPCA.2014.7045362","url":null,"abstract":"This paper describes the power system stability enhancement in Static Var Compensator (SVC) based damping controller. Here Proportional Integral Derivative (PID) and Lead-Lag (LL) controllers with associated time delay are considered for the proposed study. To find out the optimal controller parameters, Differential evolution algorithm is applied. The performance of the given controller is analysed under different disturbances for single machine infinite bus power system. To effectiveness and robustness of the proposed controllers, the various simulation results are compared under various disturbances and operating conditions.","PeriodicalId":197528,"journal":{"name":"2014 International Conference on High Performance Computing and Applications (ICHPCA)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114935715","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 : 2014-12-01DOI: 10.1109/ICHPCA.2014.7045327
Sunita Kushwaha, Sanjay Kumar
Scheduling is more complex and important in the case of multiple processor environments. In this paper we have studied various multiple processor systems and their characteristics. Also, we have compared some heuristic scheduling algorithms namely LPT (Longest Processing Time), SPT (Shortest Processing Time), ECT (Earliest Completion Time) and EST (Earliest Starting Time) for n independent jobs on m identical machines in order to minimize the turnaround time and maximize the throughput. These jobs are arriving at random time. Here, we observe that throughput and turnaround time are not changing when the number of processors is more than the number of processes. We also observe that EST is best from the point of view of throughput and turnaround time, when number of processors is less than number of processes.
{"title":"Analysis of list scheduling algorithms for parallel system","authors":"Sunita Kushwaha, Sanjay Kumar","doi":"10.1109/ICHPCA.2014.7045327","DOIUrl":"https://doi.org/10.1109/ICHPCA.2014.7045327","url":null,"abstract":"Scheduling is more complex and important in the case of multiple processor environments. In this paper we have studied various multiple processor systems and their characteristics. Also, we have compared some heuristic scheduling algorithms namely LPT (Longest Processing Time), SPT (Shortest Processing Time), ECT (Earliest Completion Time) and EST (Earliest Starting Time) for n independent jobs on m identical machines in order to minimize the turnaround time and maximize the throughput. These jobs are arriving at random time. Here, we observe that throughput and turnaround time are not changing when the number of processors is more than the number of processes. We also observe that EST is best from the point of view of throughput and turnaround time, when number of processors is less than number of processes.","PeriodicalId":197528,"journal":{"name":"2014 International Conference on High Performance Computing and Applications (ICHPCA)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116300887","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 : 2014-12-01DOI: 10.1109/ICHPCA.2014.7045306
Subhas Barman, Samiran Chattopadhyay, D. Samanta
Key management is an important issue in traditional symmetric cryptography. It consists of key generation, key modification and key sharing to establish a message communication between partners. In general, a randomly generated key is shared with the counter partner by transmitting it along with the message or prior to the message communication. Maintaining privacy of cryptographic key determines the security of cryptography. Biometric is the alternate to maintain the privacy of key by protecting it with users biometric from unauthorized access. In this paper, a cryptographic key is linked with users fingerprint data. A string of binary number as cryptographic key is extracted from fingerprint template and this key is used to encrypt a message. During decryption process, the user is able to generate that cryptographic key from a fresh fingerprint instance to decrypt the encrypted message.
{"title":"Fingerprint based symmetric cryptography","authors":"Subhas Barman, Samiran Chattopadhyay, D. Samanta","doi":"10.1109/ICHPCA.2014.7045306","DOIUrl":"https://doi.org/10.1109/ICHPCA.2014.7045306","url":null,"abstract":"Key management is an important issue in traditional symmetric cryptography. It consists of key generation, key modification and key sharing to establish a message communication between partners. In general, a randomly generated key is shared with the counter partner by transmitting it along with the message or prior to the message communication. Maintaining privacy of cryptographic key determines the security of cryptography. Biometric is the alternate to maintain the privacy of key by protecting it with users biometric from unauthorized access. In this paper, a cryptographic key is linked with users fingerprint data. A string of binary number as cryptographic key is extracted from fingerprint template and this key is used to encrypt a message. During decryption process, the user is able to generate that cryptographic key from a fresh fingerprint instance to decrypt the encrypted message.","PeriodicalId":197528,"journal":{"name":"2014 International Conference on High Performance Computing and Applications (ICHPCA)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125075235","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 : 2014-12-01DOI: 10.1109/ICHPCA.2014.7045317
A. Semwal, A. S. Buttar
Numerous methodologies, system models and modulation techniques are present in literatures for indoor Visible Light Communication (VLC). This paper proposed a VLC system model, for Line of Sight (LOS) and partially Non Line of Sight (NLOS) in indoor applications. The novice modulation technique based on polarization phase shift key and Brewster's angle based polarization diversity technique (BABPDT). By introducing a transparent sheet in between the transmitter and receiver to alleviate the shadowing problem faced in VLC system. When an optical signal is incident on transparent sheet at Brewster's angle, the signal get polarized into two signals. The polarized reflected signal and polarized transmitted signal. The visible light portion of quanta particles of electromagnetic spectrum is used to transmit information via LEDs as a transmitter and photo diode as a receiver.
{"title":"Minimization of the BER using Brewster's angle based polarization diversity technique for indoor Visible Light Communication system","authors":"A. Semwal, A. S. Buttar","doi":"10.1109/ICHPCA.2014.7045317","DOIUrl":"https://doi.org/10.1109/ICHPCA.2014.7045317","url":null,"abstract":"Numerous methodologies, system models and modulation techniques are present in literatures for indoor Visible Light Communication (VLC). This paper proposed a VLC system model, for Line of Sight (LOS) and partially Non Line of Sight (NLOS) in indoor applications. The novice modulation technique based on polarization phase shift key and Brewster's angle based polarization diversity technique (BABPDT). By introducing a transparent sheet in between the transmitter and receiver to alleviate the shadowing problem faced in VLC system. When an optical signal is incident on transparent sheet at Brewster's angle, the signal get polarized into two signals. The polarized reflected signal and polarized transmitted signal. The visible light portion of quanta particles of electromagnetic spectrum is used to transmit information via LEDs as a transmitter and photo diode as a receiver.","PeriodicalId":197528,"journal":{"name":"2014 International Conference on High Performance Computing and Applications (ICHPCA)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123740054","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 : 2014-12-01DOI: 10.1109/ICHPCA.2014.7045313
S. Parija, P. K. Sahu, S. S. Singh
In cellular network cost involved in location management is higher but this issue is more common, crucial and complex problem. Although location management issues have been emerged in the field of communications no specific definition has been devised for it. Wireless network area is usually consisting of location area and paging area. The cost involved when a mobile subscriber moving in a particular service area. Since during a call the exact location of the subscriber must be known to the network the management of the network is to track the subscriber when a call comes to mobile device. For the same some cost is incurred that is location update cost and paging cost of the subscriber during the movement in a location service area. This study proposes a new evolutionary approach named Binary Differential Evolution (BDE) minimizes the total cost involved in wireless network. This technique is a stochastic, population-based optimization strategy proposed for combinatorial optimization problem to solve the location management issue. Here the given cellular network is partitioned into reporting cell and non-reporting cell so as to optimize the location area of a given cellular area. BDE is a meta-heuristic strategy presented to be a very powerful widely used technique based on evolutionary algorithms with some specific characteristics. Among the various evolutionary strategies BDE is one of the biological global optimization approach with reduced complexity has received a wide attraction from many fields such as computer science, economics and engineering fields. With the help of the realistic data for generating the test network simulation are carried out in different networks and the results are demonstrated and discussed in this work. The objective of this work is to define the best values to the Differential Evolution (DE) configuration by considering various parameters using realistic network.
{"title":"Differential evolution for cost reduction in cellular network","authors":"S. Parija, P. K. Sahu, S. S. Singh","doi":"10.1109/ICHPCA.2014.7045313","DOIUrl":"https://doi.org/10.1109/ICHPCA.2014.7045313","url":null,"abstract":"In cellular network cost involved in location management is higher but this issue is more common, crucial and complex problem. Although location management issues have been emerged in the field of communications no specific definition has been devised for it. Wireless network area is usually consisting of location area and paging area. The cost involved when a mobile subscriber moving in a particular service area. Since during a call the exact location of the subscriber must be known to the network the management of the network is to track the subscriber when a call comes to mobile device. For the same some cost is incurred that is location update cost and paging cost of the subscriber during the movement in a location service area. This study proposes a new evolutionary approach named Binary Differential Evolution (BDE) minimizes the total cost involved in wireless network. This technique is a stochastic, population-based optimization strategy proposed for combinatorial optimization problem to solve the location management issue. Here the given cellular network is partitioned into reporting cell and non-reporting cell so as to optimize the location area of a given cellular area. BDE is a meta-heuristic strategy presented to be a very powerful widely used technique based on evolutionary algorithms with some specific characteristics. Among the various evolutionary strategies BDE is one of the biological global optimization approach with reduced complexity has received a wide attraction from many fields such as computer science, economics and engineering fields. With the help of the realistic data for generating the test network simulation are carried out in different networks and the results are demonstrated and discussed in this work. The objective of this work is to define the best values to the Differential Evolution (DE) configuration by considering various parameters using realistic network.","PeriodicalId":197528,"journal":{"name":"2014 International Conference on High Performance Computing and Applications (ICHPCA)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131015730","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 : 2014-12-01DOI: 10.1109/ICHPCA.2014.7045360
S. Goswami, S. Misra, M. Mukesh
With digitization of documents becoming a buzz word, several research initiatives have been taken in the field. However, an associated challenge that arises is the process of certifying and validating document integrity and ensuring non-repudiation. E-signatures gave a solution but could not prove the signer's identity. Digital certificates were thereafter used along with signatures to prove the identity of the signer. In this paper we present a schema for embedding digital signature as well as certifying and verifying the content of electronic document in a secured and tamperproof manner. Digital signature is created with hash value of the document generated by a hashing algorithm and encrypting the hash value by private key of the signer. Finally, the document is time stamped by an authorized time stamping server. The paper incorporates a novel online validation mechanism for ensuring the usage of live certificate in signing the document and also checks the integrity of the document. It also suppresses the replay attack by encrypting user credential at one end and decrypting and verifying it at the other end with asymmetric key cryptography. Another unique mechanism incorporated to redundantly suppress replay attach is to embed a timestamp, generated by authorized third party time-stamping authority, which registers and verifies user identity. The system was exposed to security vulnerability assessment using a suite of tools as well as other mechanisms reported in literature. Results of attack assessment indicated that the system is capable of handling most of the dangerous threats and vulnerabilities.
{"title":"A PKI based timestamped secure signing tool for e-documents","authors":"S. Goswami, S. Misra, M. Mukesh","doi":"10.1109/ICHPCA.2014.7045360","DOIUrl":"https://doi.org/10.1109/ICHPCA.2014.7045360","url":null,"abstract":"With digitization of documents becoming a buzz word, several research initiatives have been taken in the field. However, an associated challenge that arises is the process of certifying and validating document integrity and ensuring non-repudiation. E-signatures gave a solution but could not prove the signer's identity. Digital certificates were thereafter used along with signatures to prove the identity of the signer. In this paper we present a schema for embedding digital signature as well as certifying and verifying the content of electronic document in a secured and tamperproof manner. Digital signature is created with hash value of the document generated by a hashing algorithm and encrypting the hash value by private key of the signer. Finally, the document is time stamped by an authorized time stamping server. The paper incorporates a novel online validation mechanism for ensuring the usage of live certificate in signing the document and also checks the integrity of the document. It also suppresses the replay attack by encrypting user credential at one end and decrypting and verifying it at the other end with asymmetric key cryptography. Another unique mechanism incorporated to redundantly suppress replay attach is to embed a timestamp, generated by authorized third party time-stamping authority, which registers and verifies user identity. The system was exposed to security vulnerability assessment using a suite of tools as well as other mechanisms reported in literature. Results of attack assessment indicated that the system is capable of handling most of the dangerous threats and vulnerabilities.","PeriodicalId":197528,"journal":{"name":"2014 International Conference on High Performance Computing and Applications (ICHPCA)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126880149","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 : 2014-12-01DOI: 10.1109/ICHPCA.2014.7045350
Dwaipayan Chakraborty, S. Saha, Oindrilla Dutta
In this paper, a new hybrid population based algorithm (DE-FPA) is proposed with the combination of differential evolution optimization algorithm and flower pollination algorithm. The main idea is to integrate the natural evolution characteristics of the population in differential evolution algorithm with the pollination behavior of flowering plant in flower pollination algorithm to synthesize the strength and power of both the algorithms. The hybrid algorithm is robust in the sense that the globalization takes place in evolution. Some benchmark test functions are utilized here to compare the hybrid algorithm with the individual DE and FPA algorithms in searching the best solution. The results show the hybrid algorithm possesses a better capability in searching for the sufficiently good solution and to escape from local optima. In addition to that, a novel concept of dynamic adaptive weight is introduced for faster convergence than the individual algorithms, thereby making the hybrid one competent.
{"title":"DE-FPA: A hybrid differential evolution-flower pollination algorithm for function minimization","authors":"Dwaipayan Chakraborty, S. Saha, Oindrilla Dutta","doi":"10.1109/ICHPCA.2014.7045350","DOIUrl":"https://doi.org/10.1109/ICHPCA.2014.7045350","url":null,"abstract":"In this paper, a new hybrid population based algorithm (DE-FPA) is proposed with the combination of differential evolution optimization algorithm and flower pollination algorithm. The main idea is to integrate the natural evolution characteristics of the population in differential evolution algorithm with the pollination behavior of flowering plant in flower pollination algorithm to synthesize the strength and power of both the algorithms. The hybrid algorithm is robust in the sense that the globalization takes place in evolution. Some benchmark test functions are utilized here to compare the hybrid algorithm with the individual DE and FPA algorithms in searching the best solution. The results show the hybrid algorithm possesses a better capability in searching for the sufficiently good solution and to escape from local optima. In addition to that, a novel concept of dynamic adaptive weight is introduced for faster convergence than the individual algorithms, thereby making the hybrid one competent.","PeriodicalId":197528,"journal":{"name":"2014 International Conference on High Performance Computing and Applications (ICHPCA)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114003833","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 : 2014-12-01DOI: 10.1109/ICHPCA.2014.7045344
Neha Sharma, Sujata, G. Purohit
Regression testing is an expensive process. A number of methodologies of regression testing are used to improve its effectiveness. These are retest all, test case selection, test case reduction and test case prioritization. Retest all technique involves re-execution of all available test suites, which are critical moreover cost effective. In order to increase efficiency, test case prioritization is being utilized for rearranging the test cases. A number of algorithms has been stated in the literature survey such as Greedy Algorithms and Metaheuristic search algorithms. A simple greedy algorithm focuses on test case prioritization but results in less efficient manner, due to which researches moved towards the additional greedy and 2-Optimal algorithms. Forthcoming metaheuristic search technique (Hill climbing and Genetic Algorithm) produces a much better solution to the test case prioritization problem. It implements stochastic optimization while dealing with problem concern. The genetic algorithm is an evolutionary algorithm which gives an exact mathematical fitness value for the test cases on which prioritization is done. This paper focuses on the comparison of metaheuristic genetic algorithm with other algorithms and proves the efficiency of genetic algorithm over the remaining ones.
{"title":"Test case prioritization techniques “an empirical study”","authors":"Neha Sharma, Sujata, G. Purohit","doi":"10.1109/ICHPCA.2014.7045344","DOIUrl":"https://doi.org/10.1109/ICHPCA.2014.7045344","url":null,"abstract":"Regression testing is an expensive process. A number of methodologies of regression testing are used to improve its effectiveness. These are retest all, test case selection, test case reduction and test case prioritization. Retest all technique involves re-execution of all available test suites, which are critical moreover cost effective. In order to increase efficiency, test case prioritization is being utilized for rearranging the test cases. A number of algorithms has been stated in the literature survey such as Greedy Algorithms and Metaheuristic search algorithms. A simple greedy algorithm focuses on test case prioritization but results in less efficient manner, due to which researches moved towards the additional greedy and 2-Optimal algorithms. Forthcoming metaheuristic search technique (Hill climbing and Genetic Algorithm) produces a much better solution to the test case prioritization problem. It implements stochastic optimization while dealing with problem concern. The genetic algorithm is an evolutionary algorithm which gives an exact mathematical fitness value for the test cases on which prioritization is done. This paper focuses on the comparison of metaheuristic genetic algorithm with other algorithms and proves the efficiency of genetic algorithm over the remaining ones.","PeriodicalId":197528,"journal":{"name":"2014 International Conference on High Performance Computing and Applications (ICHPCA)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114598782","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 : 2014-12-01DOI: 10.1109/ICHPCA.2014.7045342
M. Lalitha, T. Janardhan, R. Mohan
In recent years the Double-Fed Induction Generator (DFIG) gaining more popular due to their variable speed and variable pitch control. A dynamic Solid oxide fuel cell (SOFC) is integrated with Double fed Induction Generator (DFIG), due to their fluctuating nature of wind energy. This paper presents a simulation of SOFC fuel cell integrated with a doubly fed induction generator to maintain grid voltage constant 440 V and 50 Hz. Existing literature used PI controller based vector control technique for the control of DFIG. In this work, fuzzy logic controller is proposed to decrease total harmonic distortion in grid current. The performance of the system for sudden load changes with PI control and proposed control technique has been obtained and compared, by using MATLAB SIMULINK.
{"title":"Fuzzy logic based wind energy conversion system with Solid oxide fuel cell","authors":"M. Lalitha, T. Janardhan, R. Mohan","doi":"10.1109/ICHPCA.2014.7045342","DOIUrl":"https://doi.org/10.1109/ICHPCA.2014.7045342","url":null,"abstract":"In recent years the Double-Fed Induction Generator (DFIG) gaining more popular due to their variable speed and variable pitch control. A dynamic Solid oxide fuel cell (SOFC) is integrated with Double fed Induction Generator (DFIG), due to their fluctuating nature of wind energy. This paper presents a simulation of SOFC fuel cell integrated with a doubly fed induction generator to maintain grid voltage constant 440 V and 50 Hz. Existing literature used PI controller based vector control technique for the control of DFIG. In this work, fuzzy logic controller is proposed to decrease total harmonic distortion in grid current. The performance of the system for sudden load changes with PI control and proposed control technique has been obtained and compared, by using MATLAB SIMULINK.","PeriodicalId":197528,"journal":{"name":"2014 International Conference on High Performance Computing and Applications (ICHPCA)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129600653","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
扫码关注我们
求助内容：
应助结果提醒方式：