An Algorithm for Generating Boolean Expressions in VHDL Based on Ladder Diagrams
This study proposes an algorithm for generating the associated Boolean expression in VHDL, given a ladder diagram (LD) as the input. The purpose of the algorithm is to implement of field-programmable gate array- (FPGA-) based programmable logic controllers (PLCs), where an effective conversion from...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2015-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2015/530586 |
id |
doaj-9e1d842c31d4499fa8da513a549e0204 |
---|---|
record_format |
Article |
spelling |
doaj-9e1d842c31d4499fa8da513a549e02042020-11-24T21:07:12ZengHindawi LimitedMathematical Problems in Engineering1024-123X1563-51472015-01-01201510.1155/2015/530586530586An Algorithm for Generating Boolean Expressions in VHDL Based on Ladder DiagramsHongxia Xie0Zheng-Yun Zhuang1School of Computer and Computing Science, City College, Zhejiang University, 51 Huzhou Street, Hangzhou, Zhejiang 310015, ChinaSchool of Computer and Computing Science, City College, Zhejiang University, 51 Huzhou Street, Hangzhou, Zhejiang 310015, ChinaThis study proposes an algorithm for generating the associated Boolean expression in VHDL, given a ladder diagram (LD) as the input. The purpose of the algorithm is to implement of field-programmable gate array- (FPGA-) based programmable logic controllers (PLCs), where an effective conversion from an LD to its associated Boolean expressions seems rarely mentioned. Based on this core thought, the conversion process of the algorithm first involves abstracting and expressing the encountered LD as an activity-on-vertex (AOV) graph. Next, an AND-OR tree in which AND-nodes and OR-nodes connote the series and the parallel relationships between the vertices of the AOV graph is constructed based on the AOV graph. Therefore, by a traversal to the AND-OR tree, the associated Boolean expression, as the output of the algorithm, can be easily obtained in VHDL. The proposed algorithm is then verified with an illustrative example, wherein a complicated LD is given as the input.http://dx.doi.org/10.1155/2015/530586 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Hongxia Xie Zheng-Yun Zhuang |
spellingShingle |
Hongxia Xie Zheng-Yun Zhuang An Algorithm for Generating Boolean Expressions in VHDL Based on Ladder Diagrams Mathematical Problems in Engineering |
author_facet |
Hongxia Xie Zheng-Yun Zhuang |
author_sort |
Hongxia Xie |
title |
An Algorithm for Generating Boolean Expressions in VHDL Based on Ladder Diagrams |
title_short |
An Algorithm for Generating Boolean Expressions in VHDL Based on Ladder Diagrams |
title_full |
An Algorithm for Generating Boolean Expressions in VHDL Based on Ladder Diagrams |
title_fullStr |
An Algorithm for Generating Boolean Expressions in VHDL Based on Ladder Diagrams |
title_full_unstemmed |
An Algorithm for Generating Boolean Expressions in VHDL Based on Ladder Diagrams |
title_sort |
algorithm for generating boolean expressions in vhdl based on ladder diagrams |
publisher |
Hindawi Limited |
series |
Mathematical Problems in Engineering |
issn |
1024-123X 1563-5147 |
publishDate |
2015-01-01 |
description |
This study proposes an algorithm for generating the associated Boolean expression in VHDL, given a ladder diagram (LD) as the input. The purpose of the algorithm is to implement of field-programmable gate array- (FPGA-) based programmable logic controllers (PLCs), where an effective conversion from an LD to its associated Boolean expressions seems rarely mentioned. Based on this core thought, the conversion process of the algorithm first involves abstracting and expressing the encountered LD as an activity-on-vertex (AOV) graph. Next, an AND-OR tree in which AND-nodes and OR-nodes connote the series and the parallel relationships between the vertices of the AOV graph is constructed based on the AOV graph. Therefore, by a traversal to the AND-OR tree, the associated Boolean expression, as the output of the algorithm, can be easily obtained in VHDL. The proposed algorithm is then verified with an illustrative example, wherein a complicated LD is given as the input. |
url |
http://dx.doi.org/10.1155/2015/530586 |
work_keys_str_mv |
AT hongxiaxie analgorithmforgeneratingbooleanexpressionsinvhdlbasedonladderdiagrams AT zhengyunzhuang analgorithmforgeneratingbooleanexpressionsinvhdlbasedonladderdiagrams AT hongxiaxie algorithmforgeneratingbooleanexpressionsinvhdlbasedonladderdiagrams AT zhengyunzhuang algorithmforgeneratingbooleanexpressionsinvhdlbasedonladderdiagrams |
_version_ |
1716763755351638016 |