From 2007.igem.org
(Difference between revisions)
|
|
| (15 intermediate revisions not shown) |
| Line 1: |
Line 1: |
| - | <center><font size="6">[[Image:UWLogo.jpg]] University of Waterloo iGEM Team </font></center>
| + | ===Full Adder=== |
| | | | |
| - | {| style="border-spacing:0px; border-width:thin; border-color:black; border-style:solid"
| + | As a future project, we would like to extend our half-adder to a full-adder, which would allow us to add numbers consisting of more than one digit. For example, a half-adder could perform the addition 1 + 0 = 1, or 1 + 1 = 10, but it would take a full-adder to be able to perform 1100101 + 100101. |
| - | |-
| + | |
| - | | style="font-size:x-large; font-weight:bold; border-bottom-width:thin; border-bottom-color:black; border-bottom-style:solid; font-size:x-large; font-weight:bold; padding:5px; background-color:#CCCCCC" | Our Team
| + | |
| - | |-
| + | |
| - | | style="padding:5px" | [[Image:Group photo mimi1.JPG|500px]]
| + | |
| - | |-
| + | |
| - | |
| + | |
| - | |-
| + | |
| - | | style="padding:5px" | The UW iGEM team is a very interdisciplinary group. Our team members span the three faculties of Science, Mathematics and Engineering and include the programs of Biology, Biomedical Sciences, Computer Science, Bioinformatics, Computer Engineering, Electrical Engineering, Chemical Engineering, and Mathematical Physics at undergraduate and graduate levels. Even our professor advisors are cross-appointed to two other faculties. Our diverse backgrounds bring together a wide range of skills and ideas to the iGEM project. iGEM is giving us the opportunity to apply the skills learned in our lectures and labs to real life applications in molecular biology and biotechnology.
| + | |
| - | |-
| + | |
| - | |
| + | |
| - | |}
| + | |
| | | | |
| - | <br clear="all">
| + | A full-adder is a half-adder that accepts an extra input, namely the carry digit from another full-adder. Each full-adder is responsible for adding one pair of corresponding digits from the two numbers to be added, and it must add to that the carry bit from the previous full-adder. The full-adder will output the resulting sum bit and carry bit, and the process will continue until all the digits have been added. Such a chain of full-adders is called a ripple carry adder. |
| | | | |
| - | {| style="border-spacing:0px; border-width:thin; border-color:black; border-style:solid; width:100%"
| + | Below is a diagram of all the outputs considering all possible inputs. The major change from the half adder design, is the possibility of expressing both green and red fluorescent proteins at the same time. This represent binary 11, or decimal 3. This happens when both inputs and the carry are 1. That is 1 + 1 + 1 = 11. |
| - | |-
| + | |
| - | | colspan="4" style="border-bottom-width:thin; border-bottom-color:black; border-bottom-style:solid; font-size:x-large; font-weight:bold; padding:5px; background-color:#CCCCCC" | Abstract
| + | |
| - | |-
| + | |
| - | | colspan="4" style="border-bottom-width:thin; border-bottom-color:black; border-bottom-style:solid; padding:5px" | //Text for abstract goes here
| + | |
| - | |-
| + | |
| - | | style="width:25%; border-right-width:thin; border-right-color:black; border-right-style:solid; font-size:large; text-align:center; padding:5px" | [[Project | Project]] || style="width:25%; border-right-width:thin; border-right-color:black; border-right-style:solid; font-size:large; text-align:center; padding:5px" | [[Modelling | Modelling]] || style="width:25%; border-right-width:thin; border-right-color:black; border-right-style:solid; font-size:large; text-align:center; padding:5px" | [[Construction_Testing | Construction & Testing]] || style="width:25%; font-size:large; text-align:center; padding:5px" | [[Extensions | Extensions ]]
| + | |
| - | |-
| + | |
| - | | style="border-right-width:thin; border-right-color:black; border-right-style:solid; padding:5px" | //Project || style="border-right-width:thin; border-right-color:black; border-right-style:solid; padding:5px" | //Modelling || style="border-right-width:thin; border-right-color:black; border-right-style:solid; padding:5px" | //Construction & Testing || style="padding:5px" | //Extensions
| + | |
| - | |}
| + | |
| | | | |
| - | <br clear="all">
| |
| | | | |
| - | {| style="border-spacing:0px; border-width:thin; border-color:black; border-style:solid; width:100%; text-align:center"
| + | [[Image:UW_full_adder_diagram.PNG |thumb|center|700px|Inputs and Outputs of the Biological Full Adder]] |
| - | |-
| + | |
| - | | style="font-size:x-large; font-weight:bold; font-size:x-large; font-weight:bold; padding:5px; background-color:#CCCCCC; border-bottom-width:thin; border-bottom-color:black; border-bottom-style:solid; text-align:left" colspan="15" | Acknowledgements
| + | |
| - | |-
| + | Although the output complexity seems similar, this a full-adder has the complexity of two half-adders when built electrically. Because of our XOR gate design, it makes it possible to add a third input to the XOR gate without doubling the number of genes needed. |
| - | | colspan="3" | [[Image:Fsf_logo.gif|150px]] || colspan="3" | [[Image:MEF_logo.gif|150px]] || colspan="3" | [[Image:SFF_Logo.gif|150px]] || colspan="3" | [[Image:WEEFLogo.jpg|150px]] || colspan="3" | [[Image:WatSEF_Logo.jpg|150px]]
| + | |
| - | |-
| + | A gene design that makes use of some of the half-adder components can be seen below: |
| - | | colspan="3" | [http://www.science.uwaterloo.ca/fsf/index.html Faculty of Science Foundation ] || colspan="3" | [http://www.student.math.uwaterloo.ca/~mefcom/ Mathematics Endowment Fund ] || colspan="3" | [http://www.eng.uwaterloo.ca/~sff/ Sir Sanford Fleming Foundation] || colspan="3" | [http://www.weef.uwaterloo.ca/ Waterloo Engineering Endowment Fund] || colspan="3" | [http://www.science.uwaterloo.ca/~watsef/mainpage.html Waterloo Science Endowment Fund]
| + | |
| - | |-
| + | |
| - | | colspan="15" |
| + | [[Image:GeneDesignFA.JPG|frame|center|Full Adder|]] |
| - | |-
| + | |
| - | | colspan="5" | [[Image:UW_EngFacLogo.PNG |150px]] || colspan="5" | [[Image:UW_SciFacLogo.PNG|150px]] || colspan="5" | [[Image:UW_MathFacLogo.PNG|150px]]
| + | |
| - | |-
| + | |
| - | | colspan="5" | University of Waterloo Faculty of Engineering || colspan="5" | University of Waterloo Faculty of Science || colspan="5" | University of Waterloo Faculty of Mathematics
| + | A major challenge in this design, other than its sheer size, would be finding another quorum sensing system which will not interfere with the first. ''tra'' is currently standing in, but we do not believe it will work. We would also like to try using a quad-part inverter from the registry to invert the activity of ompR. |
| - | |-
| + | <br style="clear:both;"/> |
| - | | colspan="15" |
| + | |
| - | |-
| + | <center> |
| - | | colspan="15" style="text-align:left; padding:5px" | We would like to thank the following people for their support and guidance:
| + | [[Waterloo | Home ]] | [[Project | Project]] | [[Modelling | Mathematical Modelling]] | [[Construction_and_Testing | Construction and Testing]] | [[Future_Work | Future Work]] |
| - | * Dr. Trevor Charles
| + | </center> |
| - | * Dr. Barbara Moffatt
| + | |
| - | * Dr. Joshua Neufeld
| + | |
| - | |}
| + | |
Latest revision as of 03:10, 27 October 2007
Full Adder
As a future project, we would like to extend our half-adder to a full-adder, which would allow us to add numbers consisting of more than one digit. For example, a half-adder could perform the addition 1 + 0 = 1, or 1 + 1 = 10, but it would take a full-adder to be able to perform 1100101 + 100101.
A full-adder is a half-adder that accepts an extra input, namely the carry digit from another full-adder. Each full-adder is responsible for adding one pair of corresponding digits from the two numbers to be added, and it must add to that the carry bit from the previous full-adder. The full-adder will output the resulting sum bit and carry bit, and the process will continue until all the digits have been added. Such a chain of full-adders is called a ripple carry adder.
Below is a diagram of all the outputs considering all possible inputs. The major change from the half adder design, is the possibility of expressing both green and red fluorescent proteins at the same time. This represent binary 11, or decimal 3. This happens when both inputs and the carry are 1. That is 1 + 1 + 1 = 11.
Inputs and Outputs of the Biological Full Adder
Although the output complexity seems similar, this a full-adder has the complexity of two half-adders when built electrically. Because of our XOR gate design, it makes it possible to add a third input to the XOR gate without doubling the number of genes needed.
A gene design that makes use of some of the half-adder components can be seen below:
A major challenge in this design, other than its sheer size, would be finding another quorum sensing system which will not interfere with the first. tra is currently standing in, but we do not believe it will work. We would also like to try using a quad-part inverter from the registry to invert the activity of ompR.
Home | Project | Mathematical Modelling | Construction and Testing | Future Work
