initial commit of all data

41 files changed, 7795 insertions, 0 deletions

diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..cd41a0a
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1,3 @@
+/build/
+/doc/
+/utilities/*.pyc
diff --git a/COPYING b/COPYING
new file mode 100644
index 0000000..6b156fe
--- /dev/null
+++ b/COPYING
@@ -0,0 +1,675 @@
+GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    {one line to give the program's name and a brief idea of what it does.}
+    Copyright (C) {year}  {name of author}
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    {project}  Copyright (C) {year}  {fullname}
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
+
diff --git a/COPYING.BSD b/COPYING.BSD
new file mode 100644
index 0000000..5e037a5
--- /dev/null
+++ b/COPYING.BSD
@@ -0,0 +1,11 @@
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+
+2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+
+3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/COPYING.LESSER b/COPYING.LESSER
new file mode 100644
index 0000000..65c5ca8
--- /dev/null
+++ b/COPYING.LESSER
@@ -0,0 +1,165 @@
+                   GNU LESSER GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+
+  This version of the GNU Lesser General Public License incorporates
+the terms and conditions of version 3 of the GNU General Public
+License, supplemented by the additional permissions listed below.
+
+  0. Additional Definitions.
+
+  As used herein, "this License" refers to version 3 of the GNU Lesser
+General Public License, and the "GNU GPL" refers to version 3 of the GNU
+General Public License.
+
+  "The Library" refers to a covered work governed by this License,
+other than an Application or a Combined Work as defined below.
+
+  An "Application" is any work that makes use of an interface provided
+by the Library, but which is not otherwise based on the Library.
+Defining a subclass of a class defined by the Library is deemed a mode
+of using an interface provided by the Library.
+
+  A "Combined Work" is a work produced by combining or linking an
+Application with the Library.  The particular version of the Library
+with which the Combined Work was made is also called the "Linked
+Version".
+
+  The "Minimal Corresponding Source" for a Combined Work means the
+Corresponding Source for the Combined Work, excluding any source code
+for portions of the Combined Work that, considered in isolation, are
+based on the Application, and not on the Linked Version.
+
+  The "Corresponding Application Code" for a Combined Work means the
+object code and/or source code for the Application, including any data
+and utility programs needed for reproducing the Combined Work from the
+Application, but excluding the System Libraries of the Combined Work.
+
+  1. Exception to Section 3 of the GNU GPL.
+
+  You may convey a covered work under sections 3 and 4 of this License
+without being bound by section 3 of the GNU GPL.
+
+  2. Conveying Modified Versions.
+
+  If you modify a copy of the Library, and, in your modifications, a
+facility refers to a function or data to be supplied by an Application
+that uses the facility (other than as an argument passed when the
+facility is invoked), then you may convey a copy of the modified
+version:
+
+   a) under this License, provided that you make a good faith effort to
+   ensure that, in the event an Application does not supply the
+   function or data, the facility still operates, and performs
+   whatever part of its purpose remains meaningful, or
+
+   b) under the GNU GPL, with none of the additional permissions of
+   this License applicable to that copy.
+
+  3. Object Code Incorporating Material from Library Header Files.
+
+  The object code form of an Application may incorporate material from
+a header file that is part of the Library.  You may convey such object
+code under terms of your choice, provided that, if the incorporated
+material is not limited to numerical parameters, data structure
+layouts and accessors, or small macros, inline functions and templates
+(ten or fewer lines in length), you do both of the following:
+
+   a) Give prominent notice with each copy of the object code that the
+   Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the object code with a copy of the GNU GPL and this license
+   document.
+
+  4. Combined Works.
+
+  You may convey a Combined Work under terms of your choice that,
+taken together, effectively do not restrict modification of the
+portions of the Library contained in the Combined Work and reverse
+engineering for debugging such modifications, if you also do each of
+the following:
+
+   a) Give prominent notice with each copy of the Combined Work that
+   the Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the Combined Work with a copy of the GNU GPL and this license
+   document.
+
+   c) For a Combined Work that displays copyright notices during
+   execution, include the copyright notice for the Library among
+   these notices, as well as a reference directing the user to the
+   copies of the GNU GPL and this license document.
+
+   d) Do one of the following:
+
+       0) Convey the Minimal Corresponding Source under the terms of this
+       License, and the Corresponding Application Code in a form
+       suitable for, and under terms that permit, the user to
+       recombine or relink the Application with a modified version of
+       the Linked Version to produce a modified Combined Work, in the
+       manner specified by section 6 of the GNU GPL for conveying
+       Corresponding Source.
+
+       1) Use a suitable shared library mechanism for linking with the
+       Library.  A suitable mechanism is one that (a) uses at run time
+       a copy of the Library already present on the user's computer
+       system, and (b) will operate properly with a modified version
+       of the Library that is interface-compatible with the Linked
+       Version.
+
+   e) Provide Installation Information, but only if you would otherwise
+   be required to provide such information under section 6 of the
+   GNU GPL, and only to the extent that such information is
+   necessary to install and execute a modified version of the
+   Combined Work produced by recombining or relinking the
+   Application with a modified version of the Linked Version. (If
+   you use option 4d0, the Installation Information must accompany
+   the Minimal Corresponding Source and Corresponding Application
+   Code. If you use option 4d1, you must provide the Installation
+   Information in the manner specified by section 6 of the GNU GPL
+   for conveying Corresponding Source.)
+
+  5. Combined Libraries.
+
+  You may place library facilities that are a work based on the
+Library side by side in a single library together with other library
+facilities that are not Applications and are not covered by this
+License, and convey such a combined library under terms of your
+choice, if you do both of the following:
+
+   a) Accompany the combined library with a copy of the same work based
+   on the Library, uncombined with any other library facilities,
+   conveyed under the terms of this License.
+
+   b) Give prominent notice with the combined library that part of it
+   is a work based on the Library, and explaining where to find the
+   accompanying uncombined form of the same work.
+
+  6. Revised Versions of the GNU Lesser General Public License.
+
+  The Free Software Foundation may publish revised and/or new versions
+of the GNU Lesser General Public License from time to time. Such new
+versions will be similar in spirit to the present version, but may
+differ in detail to address new problems or concerns.
+
+  Each version is given a distinguishing version number. If the
+Library as you received it specifies that a certain numbered version
+of the GNU Lesser General Public License "or any later version"
+applies to it, you have the option of following the terms and
+conditions either of that published version or of any later version
+published by the Free Software Foundation. If the Library as you
+received it does not specify a version number of the GNU Lesser
+General Public License, you may choose any version of the GNU Lesser
+General Public License ever published by the Free Software Foundation.
+
+  If the Library as you received it specifies that a proxy can decide
+whether future versions of the GNU Lesser General Public License shall
+apply, that proxy's public statement of acceptance of any version is
+permanent authorization for you to choose that version for the
+Library.
diff --git a/Doxyfile b/Doxyfile
new file mode 100644
index 0000000..0f41a42
--- /dev/null
+++ b/Doxyfile
@@ -0,0 +1,2384 @@
+# Doxyfile 1.8.9.1
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "Blinkenrocket"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         =
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = "doc"
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = English
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = NO
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = NO
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = NO
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = YES
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = YES
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces.
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = "src"
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank the
+# following patterns are tested:*.c, *.cc, *.cxx, *.cpp, *.c++, *.java, *.ii,
+# *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h, *.hh, *.hxx, *.hpp,
+# *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc, *.m, *.markdown,
+# *.md, *.mm, *.dox, *.py, *.f90, *.f, *.for, *.tcl, *.vhd, *.vhdl, *.ucf,
+# *.qsf, *.as and *.js.
+
+FILE_PATTERNS          =
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = YES
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# compiled with the --with-libclang option.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = YES
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. To get the times font for
+# instance you can specify
+# EXTRA_PACKAGES=times
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = NO
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = NO
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot.
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd and svg.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/Makefile b/Makefile
new file mode 100644
index 0000000..f0e1bd4
--- /dev/null
+++ b/Makefile
@@ -0,0 +1,74 @@
+MCU ?= attiny88
+AVRDUDE_PROGRAMMER ?= usbasp
+
+AVRCC ?= avr-gcc
+AVRCXX ?= avr-g++
+AVRFLASH ?= avrdude
+AVRNM ?= avr-nm
+AVROBJCOPY ?= avr-objcopy
+AVROBJDUMP ?= avr-objdump
+
+MCU_FLAGS = -mmcu=attiny88 -DF_CPU=8000000UL
+
+SHARED_FLAGS = ${MCU_FLAGS} -I. -Os -Wall -Wextra -pedantic
+SHARED_FLAGS += -funsigned-char -funsigned-bitfields -fpack-struct -fshort-enums
+SHARED_FLAGS += -flto -mstrict-X
+
+ifeq (${LANG},DE)
+	SHARED_FLAGS += -DLANG_DE
+endif
+
+CFLAGS += ${SHARED_FLAGS} -std=c11
+CXXFLAGS += ${SHARED_FLAGS} -std=c++11 -fno-rtti -fno-exceptions
+
+ASFLAGS += ${MCU_FLAGS} -wA,--warn
+LDFLAGS += -Wl,--gc-sections
+
+AVRFLAGS += -U lfuse:w:0xee:m -U hfuse:w:0xdf:m -U efuse:w:0xff:m
+AVRFLAGS += -U flash:w:build/main.hex
+#AVRFLAGS += -U eeprom:w:main.eep
+
+HEADERS  = $(wildcard src/*.h)
+ASFILES  = $(wildcard src/*.S)
+CFILES   = $(wildcard src/*.c)
+CXXFILES = $(wildcard src/*.cc)
+OBJECTS  = ${CFILES:src/%.c=build/%.o} ${CXXFILES:src/%.cc=build/%.o} ${ASFILES:src/%.S=build/%.o}
+
+all: build build/main.elf
+
+build:
+	mkdir -p build
+
+build/%.hex: build/%.elf
+	${AVROBJCOPY} -O ihex -R .eeprom $< $@
+
+build/%.eep: build/%.elf
+	${AVROBJCOPY} -j .eeprom --set-section-flags=.eeprom="alloc,load" \
+	--change-section-lma .eeprom=0 -O ihex $< $@
+
+build/%.o: src/%.cc ${HEADERS}
+	${AVRCXX} ${CXXFLAGS} -o $@ $< -c -Wl,-Map=main.map,--cref
+
+build/%.o: src/%.c ${HEADERS}
+	${AVRCC} ${CFLAGS} -o $@ $< -c -Wl,-Map=main.map,--cref
+
+build/main.elf: ${OBJECTS}
+	${AVRCXX} ${CXXFLAGS} -o $@ $^ ${LDFLAGS}
+	@echo
+	@avr-size --format=avr --mcu=${MCU} $@
+
+massprogram: all
+	python utilities/flasher.py "${AVRFLASH} -p ${MCU} -c ${AVRDUDE_PROGRAMMER} ${AVRFLAGS}"
+
+flash: program
+
+program: build/main.hex #main.eep
+	${AVRFLASH} -p ${MCU} -c ${AVRDUDE_PROGRAMMER} ${AVRFLAGS}
+
+secsize: build/main.elf
+	${AVROBJDUMP} -hw -j.text -j.bss -j.data $<
+
+funsize: build/main.elf
+	${AVRNM} --print-size --size-sort $<
+
+.PHONY: all program secsize funsize
diff --git a/MessageSpecification.md b/MessageSpecification.md
new file mode 100644
index 0000000..1df7ea4
--- /dev/null
+++ b/MessageSpecification.md
@@ -0,0 +1,117 @@
+# Audio transmission protocol definition
+
+
+This document describes the communication between the blinkenrocket and the audio generating device attached to it. It relies on the implementation of the [tagsu-avr-modem](https://github.com/Jartza/tagsu-avr-modem) for low-level communication.
+
+The communication relies on multiple components:
+
+##### START 
+A *`START`* signal which indicates the start of a transmission. It consists of two times a specific 8-bit binary pattern ( `10011001` respectively `0x99`).
+
+##### PATTERN 
+A *`PATTERN`* signal which indicates that either the start of an animation or text pattern. It consists of two times the 8-bit binary pattern ( `10101001` respectively `0xA9`)
+
+##### END
+The *`END`* signal indicates End Of Transmission. It consists of two times the 8-bit binary pattern `10000100` respectively `0x84`.
+
+##### HEADER 
+A generic *`HEADER`* which contains two byte of metadata to describe the data that follows. The two byte contain 12 bit of length information and 4 bit of data type information.
+
+```
+XXXXYYYY YYYYYYYY
+<-->
+    <----------->
+TYPE    LENGTH
+```
+
+Thus the data length can be up to 4kByte of data (4096 byte). A type of `0001` denotes a `TEXT` type pattern, a type `0010` denotes an `ANIMATION` type pattern.
+The modem only receives data for this pattern until length is exceeded. E.g. when a *`HEADER`* with the contents `00011111 11111111` is received by the modem it will read 4098 byte for the current pattern (2 byte header, 4096 byte of data).  The maximum length for texts is 4096 characters and 512 frames for animation.
+
+##### TEXT METADATA 
+
+A *`TEXTMETA`* is a two byte (16 bit) length metadata field for text type pattern. It encodes the speed (first nibble), the delay (second nibble) and the direction (third nibble). The fourth nibble is reserved for future use.
+
+```
+XXXX XXXX XXXX XXXX (MSB -> LSB)
+---- (speed)
+     ---- (delay)
+          ---- (direction)
+               ---- (reserved)
+```
+
+The speed and delay ranges from a numeric value from 0 (0000) to 15 (1111). The higher the number, the faster the speed and the longer the delay. A direction of 0 (0000) specifies a left direction, a direction of 1 (0001) specifies a right direction.
+
+The scroll rate is about 1 / (0.5 - (0.032 * speed)) columns per second (or,
+precisely, 1 / (0.002048 * (250 - (16 * speed))) columns per second). This
+means that it can range from about 2 columns per second (speed=0) to almost 49
+columns per second (speed=15). Note that it is not a linear function -- see the
+following speed <-> columns per second translation list for details:
+
+* speed =  0 :  1.95 cps
+* speed =  1 :  2.09 cps
+* speed =  2 :  2.24 cps
+* speed =  3 :  2.42 cps
+* speed =  4 :  2.63 cps
+* speed =  5 :  2.87 cps
+* speed =  6 :  3.17 cps
+* speed =  7 :  3.54 cps
+* speed =  8 :  4.00 cps
+* speed =  9 :  4.61 cps
+* speed = 10 :  5.43 cps
+* speed = 11 :  6.60 cps
+* speed = 12 :  8.42 cps
+* speed = 13 : 11.6  cps
+* speed = 14 : 18.8  cps
+* speed = 15 : 48.8  cps
+
+The delay takes 0.5 * delay seconds.
+
+##### ANIMATION METADATA
+
+A *`ANIMMETA`* is a two byte (16 bit) length metadata field for animation type pattern. It encodes the frame rate in the lower nibble of the first byte and the delay in the lower nibble of the second byte.
+
+```
+0000XXXX 0000XXXX
+<------> <------>
+ SPEED     DELAY
+```
+
+The speed and delay ranges from a numeric value from 0 (0000) to 15 (1111)
+and are calculated as described in TEXT METADATA (except that the speed
+now refers to frames per second).
+
+## Message format
+
+The message transmitted has to follow the following diagram:
+
+```
+       +--------------------------------------------------------+
+       |                                                        |
+       |                                         +--------+     |
+       |                                         v        |     |
+       |                         +--> TEXTMETA +--> DATA -+--+  |
+       v                         |                           |  |
+START +--> PATTERN +--> HEADER +-|                           +---> END
+                                 |                           |
+                                 +--> ANIMMETA +--> DATA -+--+
+                                                 ^        |
+                                                 +--------+
+```
+
+First there is a `START` signal to indicate that the transmission is about to start. This should initialize the internal state machine. After that a `PATTERN` indicator follows to indicate that a pattern is following. This is followed by the generic `HEADER` to set the size and type of the following data. Now depending on the type of the transmission there is either (XOR) the `TEXTMETA` or `ANIMMETA` fields followed by `DATA` fields that may repeat up to the length specified in the `HEADER`. After this the transmission either encounters an `END` or a repetition of the sequence starting with `PATTERN`.
+
+Important note: the length of the data must be even (e.g. `length(data) % 2 == 0`) to make the Hamming(24,16) error correction work properly.
+
+## Error detection and correction
+
+The error correction is performed using the Hamming-Code. For this application the Hamming(24,16) code is used, which contains 2 bytes of data with a ECC of 1 byte. The error correction is capabable of correcting up to two bit flips, which should be sufficient for this application.
+
+```
+XXXXXXXX YYYYYYYY EEEEEEEE
+-------- -------- --------
+ First    Second   Hamming
+```
+
+The encoding of the Hamming code is performed using [this (click me)](https://github.com/RobotRoom/Hamming) avr-specific library and [this particular](https://github.com/RobotRoom/Hamming/blob/master/HammingCalculateParitySmallAndFast.c) implementation optimized for speed and code footprint.
+
+
diff --git a/README.md b/README.md
index d42fb96..d15fec7 100644
--- a/README.md
+++ b/README.md
@@ -1 +1,69 @@
 # firmware
+Firmware for blinkenrocket
+
+Use `make && sudo make program` to flash a blinkenrocket and use the web
+editor on <http://blinkenrocket.de/> to load patterns.
+
+You can also use `cd utilities; ./modem_transmit string1 string2 string3 ...`,
+though this only supports simple string patterns and a few fixed example
+animations.
+
+# Usage
+
+## Sleep / Wakeup
+
+* Press both buttons for at least 500ms to put the rocket into deep sleep
+  (~1µW power consumption)
+* Press any key (or send a modem transmission with 100ms of extra sync pulses)
+  to turn it back on
+
+## Normal operation
+
+* Left button: Switch to previous pattern
+* Right button: Switch to next pattern
+
+The new pattern will not be loaded before the button has been released.
+
+# Error messages / conditions
+
+## "Transmission failure"
+
+A modem transmission was started, but not properly terminated. Make sure that
+your audio volume is set to 100%.
+
+## "Storage is empty"
+
+The storage does not contain any patterns yet. Use `modem_transmit` or
+<http://blinkenrocket.de/> to fill it with patterns of your choice.
+
+## Modem transmissions don't work at all
+
+Make sure that your audio volume is set to 100%. If possible, try transmitting
+from another device.
+
+## Rocket does not turn on
+
+This probably means that either your MCU (U1) is not properly powered,
+or it is unable to communicate with the storage (U2).
+
+Make sure that the right parts are soldered in the right position and check
+your soldering. Double-check parts and soldering for U1, U2, C3, R4 and R5.
+
+Make sure that the battery is correctly inserted. The plus pins must lay on TOP
+of the battery where the minus pins are below on the BOTTOM of the battery. 
+Insert the battery correctly from one side and then slide it in.
+
+## Rocket hangs during patern display / when switching patterns
+
+If the display still displays something, but does not scroll/advance the
+animation anymore and the rocket does not respond to key presses, it means that
+it is unable to communicate with the EEPROM storage.
+
+Double-check parts and soldering (especially for U1, U2, C3, R4 and R5). If you
+are really sure that everything is soldered correctly, your EEPROM might be
+faulty (not as in data corruption, but as in "does not even acknowledge its
+presence anymore"). This is quite improbable, though.
+
+# License Notes
+
+Please note that early versions of the BlinkenRocket accidentially contained a copyright protected font. This was fixed on 30rd of May 2016. We're sorry for the inconvenience this has caused! If you have an old BlinkenRocket (soldered prior to the 30rd of May 2016), please upgrade your firmware. If you do not know how to do this and need assistance, please contact us through our info@ mail address. 
diff --git a/main.elf b/main.elf
new file mode 100755
index 0000000..f3b763a
--- /dev/null
+++ b/main.elf
diff --git a/main.hex b/main.hex
new file mode 100644
index 0000000..b5229f8
--- /dev/null
+++ b/main.hex
@@ -0,0 +1,37 @@
+:1000000014C02DC02CC02BC02BC029C028C027C0B5

+:1000100026C025C024C023C022C021C02BC01FC0C1

+:100020001EC01DC01CC01BC09F0011241FBECFEFEF

+:10003000D2E0DEBFCDBF11E0A0E0B1E001C01D9273

+:10004000A631B107E1F710E0CAE2D0E003C0229781

+:10005000FE01EBD0C832D107D1F776D0EAC0D0CFBD

+:100060001F920F920FB60F9211240F900FBE0F9098

+:100070001F9018951F920F920FB60F9211242F9375

+:100080008F939F93AF93BF93EF93FF938091120150

+:10009000909113010196811522E09207F1F090935F

+:1000A00013018093120115B8E0910001F0E0EF5FB9

+:1000B000FE4F80818BB981E090E00090000102C08A

+:1000C000880F991F0A94E2F785B9809100018F5F2C

+:1000D000883039F18093000126C0109213011092EC

+:1000E0001201809111018F5F883019F08093110106

+:1000F00002C01092110180911101A1E0B1E090E0E5

+:1001000081509140FC01EA0FFB1FE770FF27E75F7A

+:10011000FE4F208120952D9321E0A930B20791F761

+:10012000C2CF10920001FF91EF91BF91AF919F91CB

+:100130008F912F910F900FBE0F901F9018951092D6

+:1001400015011092140108958091640081608093DC

+:10015000640088E10FB6F89480936000109260000C

+:100160000FBE8FEF84B98AB915B81BB888B18868FB

+:1001700088B982E085BD81E080936E008CE3809336

+:10018000090196E190930A012FE120930B019093CE

+:100190000C0180930D0110920E0110920F0110922C

+:1001A0001001789431E025E033BF889586B18878D6

+:1001B000A9F58091140190911501811548E09407EB

+:1001C00030F401969093150180931401EDCF809146

+:1001D0006E008E7F80936E0015B81BB8339BFECFE8

+:1001E000379BFCCF8FE19EE40197F1F700C0000040

+:1001F00080916C00886880936C00809168008260B8

+:100200008093680023BF889580916C0087778093E6

+:100210006C0080916E00816080936E0010921501D9

+:1002200010921401C1CFEE0FFF1F0590F491E02D45

+:060230000994F894FFCFD1

+:00000001FF

diff --git a/main.map b/main.map
new file mode 100644
index 0000000..e3f4747
--- /dev/null
+++ b/main.map
@@ -0,0 +1,523 @@
+Archive member included because of file (symbol)
+
+/usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_exit.o)
+                              /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o (exit)
+/usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_clear_bss.o)
+                              /var/folders/vn/lh8fp8wn313bb460zbdj4_ph0000gn/T//cc2goI6H.ltrans0.ltrans.o (__do_clear_bss)
+/usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_ctors.o)
+                              /var/folders/vn/lh8fp8wn313bb460zbdj4_ph0000gn/T//cc2goI6H.ltrans0.ltrans.o (__do_global_ctors)
+/usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_tablejump.o)
+                              /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_ctors.o) (__tablejump__)
+
+Discarded input sections
+
+ .text          0x0000000000000000        0x0 /var/folders/vn/lh8fp8wn313bb460zbdj4_ph0000gn/T//ccDU73Fu.o (symbol from plugin)
+
+Memory Configuration
+
+Name             Origin             Length             Attributes
+text             0x0000000000000000 0x0000000000002000 xr
+data             0x0000000000800060 0x000000000000ffa0 rw !x
+eeprom           0x0000000000810000 0x0000000000010000 rw !x
+fuse             0x0000000000820000 0x0000000000000400 rw !x
+lock             0x0000000000830000 0x0000000000000400 rw !x
+signature        0x0000000000840000 0x0000000000000400 rw !x
+*default*        0x0000000000000000 0xffffffffffffffff
+
+Linker script and memory map
+
+Address of section .data set to 0x800100
+LOAD /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+LOAD /var/folders/vn/lh8fp8wn313bb460zbdj4_ph0000gn/T//ccDU73Fu.o
+LOAD /var/folders/vn/lh8fp8wn313bb460zbdj4_ph0000gn/T//cc2goI6H.ltrans0.ltrans.o
+LOAD /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a
+LOAD /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/libm.a
+LOAD /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/libc.a
+LOAD /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a
+LOAD /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/libm.a
+START GROUP
+LOAD /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a
+LOAD /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/libm.a
+LOAD /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/libc.a
+END GROUP
+
+.hash
+ *(.hash)
+
+.dynsym
+ *(.dynsym)
+
+.dynstr
+ *(.dynstr)
+
+.gnu.version
+ *(.gnu.version)
+
+.gnu.version_d
+ *(.gnu.version_d)
+
+.gnu.version_r
+ *(.gnu.version_r)
+
+.rel.init
+ *(.rel.init)
+
+.rela.init
+ *(.rela.init)
+
+.rel.text
+ *(.rel.text)
+ *(.rel.text.*)
+ *(.rel.gnu.linkonce.t*)
+
+.rela.text
+ *(.rela.text)
+ *(.rela.text.*)
+ *(.rela.gnu.linkonce.t*)
+
+.rel.fini
+ *(.rel.fini)
+
+.rela.fini
+ *(.rela.fini)
+
+.rel.rodata
+ *(.rel.rodata)
+ *(.rel.rodata.*)
+ *(.rel.gnu.linkonce.r*)
+
+.rela.rodata
+ *(.rela.rodata)
+ *(.rela.rodata.*)
+ *(.rela.gnu.linkonce.r*)
+
+.rel.data
+ *(.rel.data)
+ *(.rel.data.*)
+ *(.rel.gnu.linkonce.d*)
+
+.rela.data
+ *(.rela.data)
+ *(.rela.data.*)
+ *(.rela.gnu.linkonce.d*)
+
+.rel.ctors
+ *(.rel.ctors)
+
+.rela.ctors
+ *(.rela.ctors)
+
+.rel.dtors
+ *(.rel.dtors)
+
+.rela.dtors
+ *(.rela.dtors)
+
+.rel.got
+ *(.rel.got)
+
+.rela.got
+ *(.rela.got)
+
+.rel.bss
+ *(.rel.bss)
+
+.rela.bss
+ *(.rela.bss)
+
+.rel.plt
+ *(.rel.plt)
+
+.rela.plt
+ *(.rela.plt)
+
+.text           0x0000000000000000      0x236
+ *(.vectors)
+ .vectors       0x0000000000000000       0x28 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+                0x0000000000000000                __vectors
+                0x0000000000000000                __vector_default
+ *(.vectors)
+ *(.progmem.gcc*)
+                0x0000000000000028                . = ALIGN (0x2)
+                0x0000000000000028                __trampolines_start = .
+ *(.trampolines)
+ .trampolines   0x0000000000000028        0x0 linker stubs
+ *(.trampolines*)
+                0x0000000000000028                __trampolines_end = .
+ *(.progmem*)
+                0x0000000000000028                . = ALIGN (0x2)
+ *(.jumptables)
+ *(.jumptables*)
+ *(.lowtext)
+ *(.lowtext*)
+                0x0000000000000028                __ctors_start = .
+ *(.ctors)
+ .ctors         0x0000000000000028        0x2 /var/folders/vn/lh8fp8wn313bb460zbdj4_ph0000gn/T//cc2goI6H.ltrans0.ltrans.o
+                0x000000000000002a                __ctors_end = .
+                0x000000000000002a                __dtors_start = .
+ *(.dtors)
+                0x000000000000002a                __dtors_end = .
+ SORT(*)(.ctors)
+ SORT(*)(.dtors)
+ *(.init0)
+ .init0         0x000000000000002a        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+                0x000000000000002a                __init
+ *(.init0)
+ *(.init1)
+ *(.init1)
+ *(.init2)
+ .init2         0x000000000000002a        0xc /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+ *(.init2)
+ *(.init3)
+ *(.init3)
+ *(.init4)
+ .init4         0x0000000000000036       0x10 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_clear_bss.o)
+                0x0000000000000036                __do_clear_bss
+ *(.init4)
+ *(.init5)
+ *(.init5)
+ *(.init6)
+ .init6         0x0000000000000046       0x14 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_ctors.o)
+                0x0000000000000046                __do_global_ctors
+ *(.init6)
+ *(.init7)
+ *(.init7)
+ *(.init8)
+ *(.init8)
+ *(.init9)
+ .init9         0x000000000000005a        0x4 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+ *(.init9)
+ *(.text)
+ .text          0x000000000000005e        0x2 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+                0x000000000000005e                __vector_18
+                0x000000000000005e                __vector_12
+                0x000000000000005e                __bad_interrupt
+                0x000000000000005e                __vector_6
+                0x000000000000005e                __vector_3
+                0x000000000000005e                __vector_11
+                0x000000000000005e                __vector_13
+                0x000000000000005e                __vector_17
+                0x000000000000005e                __vector_19
+                0x000000000000005e                __vector_7
+                0x000000000000005e                __vector_5
+                0x000000000000005e                __vector_9
+                0x000000000000005e                __vector_2
+                0x000000000000005e                __vector_15
+                0x000000000000005e                __vector_8
+                0x000000000000005e                __vector_10
+                0x000000000000005e                __vector_16
+                0x000000000000005e                __vector_1
+ .text          0x0000000000000060       0xde /var/folders/vn/lh8fp8wn313bb460zbdj4_ph0000gn/T//cc2goI6H.ltrans0.ltrans.o
+                0x0000000000000060                __vector_4
+                0x0000000000000074                __vector_14
+ .text          0x000000000000013e        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_clear_bss.o)
+ .text          0x000000000000013e        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_ctors.o)
+ .text          0x000000000000013e        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_tablejump.o)
+ .text          0x000000000000013e        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_exit.o)
+                0x000000000000013e                . = ALIGN (0x2)
+ *(.text.*)
+ .text.startup  0x000000000000013e       0xe8 /var/folders/vn/lh8fp8wn313bb460zbdj4_ph0000gn/T//cc2goI6H.ltrans0.ltrans.o
+                0x0000000000000148                main
+ .text.libgcc.mul
+                0x0000000000000226        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_clear_bss.o)
+ .text.libgcc.div
+                0x0000000000000226        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_clear_bss.o)
+ .text.libgcc   0x0000000000000226        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_clear_bss.o)
+ .text.libgcc.prologue
+                0x0000000000000226        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_clear_bss.o)
+ .text.libgcc.builtins
+                0x0000000000000226        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_clear_bss.o)
+ .text.libgcc.fmul
+                0x0000000000000226        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_clear_bss.o)
+ .text.libgcc.fixed
+                0x0000000000000226        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_clear_bss.o)
+ .text.libgcc.mul
+                0x0000000000000226        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_ctors.o)
+ .text.libgcc.div
+                0x0000000000000226        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_ctors.o)
+ .text.libgcc   0x0000000000000226        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_ctors.o)
+ .text.libgcc.prologue
+                0x0000000000000226        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_ctors.o)
+ .text.libgcc.builtins
+                0x0000000000000226        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_ctors.o)
+ .text.libgcc.fmul
+                0x0000000000000226        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_ctors.o)
+ .text.libgcc.fixed
+                0x0000000000000226        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_ctors.o)
+ .text.libgcc.mul
+                0x0000000000000226        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_tablejump.o)
+ .text.libgcc.div
+                0x0000000000000226        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_tablejump.o)
+ .text.libgcc   0x0000000000000226        0xc /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_tablejump.o)
+                0x0000000000000226                __tablejump2__
+                0x000000000000022a                __tablejump__
+ .text.libgcc.prologue
+                0x0000000000000232        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_tablejump.o)
+ .text.libgcc.builtins
+                0x0000000000000232        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_tablejump.o)
+ .text.libgcc.fmul
+                0x0000000000000232        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_tablejump.o)
+ .text.libgcc.fixed
+                0x0000000000000232        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_tablejump.o)
+ .text.libgcc.mul
+                0x0000000000000232        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_exit.o)
+ .text.libgcc.div
+                0x0000000000000232        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_exit.o)
+ .text.libgcc   0x0000000000000232        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_exit.o)
+ .text.libgcc.prologue
+                0x0000000000000232        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_exit.o)
+ .text.libgcc.builtins
+                0x0000000000000232        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_exit.o)
+ .text.libgcc.fmul
+                0x0000000000000232        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_exit.o)
+ .text.libgcc.fixed
+                0x0000000000000232        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_exit.o)
+                0x0000000000000232                . = ALIGN (0x2)
+ *(.fini9)
+ .fini9         0x0000000000000232        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_exit.o)
+                0x0000000000000232                exit
+                0x0000000000000232                _exit
+ *(.fini9)
+ *(.fini8)
+ *(.fini8)
+ *(.fini7)
+ *(.fini7)
+ *(.fini6)
+ *(.fini6)
+ *(.fini5)
+ *(.fini5)
+ *(.fini4)
+ *(.fini4)
+ *(.fini3)
+ *(.fini3)
+ *(.fini2)
+ *(.fini2)
+ *(.fini1)
+ *(.fini1)
+ *(.fini0)
+ .fini0         0x0000000000000232        0x4 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_exit.o)
+ *(.fini0)
+                0x0000000000000236                _etext = .
+
+.data           0x0000000000800100        0x0 load address 0x0000000000000236
+                0x0000000000800100                PROVIDE (__data_start, .)
+ *(.data)
+ .data          0x0000000000800100        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+ .data          0x0000000000800100        0x0 /var/folders/vn/lh8fp8wn313bb460zbdj4_ph0000gn/T//cc2goI6H.ltrans0.ltrans.o
+ .data          0x0000000000800100        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_clear_bss.o)
+ .data          0x0000000000800100        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_ctors.o)
+ .data          0x0000000000800100        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_tablejump.o)
+ .data          0x0000000000800100        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_exit.o)
+ *(.data*)
+ *(.rodata)
+ *(.rodata*)
+ *(.gnu.linkonce.d*)
+                0x0000000000800100                . = ALIGN (0x2)
+                0x0000000000800100                _edata = .
+                0x0000000000800100                PROVIDE (__data_end, .)
+
+.bss            0x0000000000800100       0x16
+                0x0000000000800100                PROVIDE (__bss_start, .)
+ *(.bss)
+ .bss           0x0000000000800100        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+ .bss           0x0000000000800100       0x16 /var/folders/vn/lh8fp8wn313bb460zbdj4_ph0000gn/T//cc2goI6H.ltrans0.ltrans.o
+ .bss           0x0000000000800116        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_clear_bss.o)
+ .bss           0x0000000000800116        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_ctors.o)
+ .bss           0x0000000000800116        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_tablejump.o)
+ .bss           0x0000000000800116        0x0 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_exit.o)
+ *(.bss*)
+ *(COMMON)
+                0x0000000000800116                PROVIDE (__bss_end, .)
+                0x0000000000000236                __data_load_start = LOADADDR (.data)
+                0x0000000000000236                __data_load_end = (__data_load_start + SIZEOF (.data))
+
+.noinit         0x0000000000800116        0x0
+                0x0000000000800116                PROVIDE (__noinit_start, .)
+ *(.noinit*)
+                0x0000000000800116                PROVIDE (__noinit_end, .)
+                0x0000000000800116                _end = .
+                0x0000000000800116                PROVIDE (__heap_start, .)
+
+.eeprom         0x0000000000810000        0x0
+ *(.eeprom*)
+                0x0000000000810000                __eeprom_end = .
+
+.fuse
+ *(.fuse)
+ *(.lfuse)
+ *(.hfuse)
+ *(.efuse)
+
+.lock
+ *(.lock*)
+
+.signature
+ *(.signature*)
+
+.stab
+ *(.stab)
+
+.stabstr
+ *(.stabstr)
+
+.stab.excl
+ *(.stab.excl)
+
+.stab.exclstr
+ *(.stab.exclstr)
+
+.stab.index
+ *(.stab.index)
+
+.stab.indexstr
+ *(.stab.indexstr)
+
+.comment        0x0000000000000000       0x11
+ *(.comment)
+ .comment       0x0000000000000000       0x11 /var/folders/vn/lh8fp8wn313bb460zbdj4_ph0000gn/T//cc2goI6H.ltrans0.ltrans.o
+                                         0x12 (size before relaxing)
+
+.note.gnu.build-id
+ *(.note.gnu.build-id)
+
+.debug
+ *(.debug)
+
+.line
+ *(.line)
+
+.debug_srcinfo
+ *(.debug_srcinfo)
+
+.debug_sfnames
+ *(.debug_sfnames)
+
+.debug_aranges  0x0000000000000000       0x80
+ *(.debug_aranges)
+ .debug_aranges
+                0x0000000000000000       0x20 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_clear_bss.o)
+ .debug_aranges
+                0x0000000000000020       0x20 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_ctors.o)
+ .debug_aranges
+                0x0000000000000040       0x20 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_tablejump.o)
+ .debug_aranges
+                0x0000000000000060       0x20 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_exit.o)
+
+.debug_pubnames
+ *(.debug_pubnames)
+
+.debug_info     0x0000000000000000      0x7e2
+ *(.debug_info .gnu.linkonce.wi.*)
+ .debug_info    0x0000000000000000      0x576 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+ .debug_info    0x0000000000000576       0x9b /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_clear_bss.o)
+ .debug_info    0x0000000000000611       0x9b /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_ctors.o)
+ .debug_info    0x00000000000006ac       0x9b /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_tablejump.o)
+ .debug_info    0x0000000000000747       0x9b /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_exit.o)
+
+.debug_abbrev   0x0000000000000000      0x57b
+ *(.debug_abbrev)
+ .debug_abbrev  0x0000000000000000      0x52b /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+ .debug_abbrev  0x000000000000052b       0x14 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_clear_bss.o)
+ .debug_abbrev  0x000000000000053f       0x14 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_ctors.o)
+ .debug_abbrev  0x0000000000000553       0x14 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_tablejump.o)
+ .debug_abbrev  0x0000000000000567       0x14 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_exit.o)
+
+.debug_line     0x0000000000000000      0x19b
+ *(.debug_line .debug_line.* .debug_line_end)
+ .debug_line    0x0000000000000000       0x1d /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+ .debug_line    0x000000000000001d       0x61 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_clear_bss.o)
+ .debug_line    0x000000000000007e       0x63 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_ctors.o)
+ .debug_line    0x00000000000000e1       0x5f /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_tablejump.o)
+ .debug_line    0x0000000000000140       0x5b /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_exit.o)
+
+.debug_frame
+ *(.debug_frame)
+
+.debug_str      0x0000000000000000      0x1d9
+ *(.debug_str)
+ .debug_str     0x0000000000000000      0x1d9 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+
+.debug_loc
+ *(.debug_loc)
+
+.debug_macinfo
+ *(.debug_macinfo)
+
+.debug_weaknames
+ *(.debug_weaknames)
+
+.debug_funcnames
+ *(.debug_funcnames)
+
+.debug_typenames
+ *(.debug_typenames)
+
+.debug_varnames
+ *(.debug_varnames)
+
+.debug_pubtypes
+ *(.debug_pubtypes)
+
+.debug_ranges
+ *(.debug_ranges)
+
+.debug_macro
+ *(.debug_macro)
+OUTPUT(main.elf elf32-avr)
+LOAD linker stubs
+
+Cross Reference Table
+
+Symbol                                            File
+Display::turn_off()                               /var/folders/vn/lh8fp8wn313bb460zbdj4_ph0000gn/T//ccDU73Fu.o (symbol from plugin)
+Display::turn_on()                                /var/folders/vn/lh8fp8wn313bb460zbdj4_ph0000gn/T//ccDU73Fu.o (symbol from plugin)
+System::loop()                                    /var/folders/vn/lh8fp8wn313bb460zbdj4_ph0000gn/T//ccDU73Fu.o (symbol from plugin)
+__bad_interrupt                                   /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+__bss_end                                         /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_clear_bss.o)
+__bss_start                                       /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_clear_bss.o)
+__ctors_end                                       /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_ctors.o)
+__ctors_start                                     /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_ctors.o)
+__do_clear_bss                                    /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_clear_bss.o)
+                                                  /var/folders/vn/lh8fp8wn313bb460zbdj4_ph0000gn/T//cc2goI6H.ltrans0.ltrans.o
+__do_global_ctors                                 /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_ctors.o)
+                                                  /var/folders/vn/lh8fp8wn313bb460zbdj4_ph0000gn/T//cc2goI6H.ltrans0.ltrans.o
+__heap_end                                        /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+__init                                            /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+__stack                                           /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+__tablejump2__                                    /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_tablejump.o)
+__tablejump__                                     /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_tablejump.o)
+                                                  /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_ctors.o)
+__vector_1                                        /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+__vector_10                                       /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+__vector_11                                       /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+__vector_12                                       /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+__vector_13                                       /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+__vector_14                                       /var/folders/vn/lh8fp8wn313bb460zbdj4_ph0000gn/T//cc2goI6H.ltrans0.ltrans.o
+                                                  /var/folders/vn/lh8fp8wn313bb460zbdj4_ph0000gn/T//ccDU73Fu.o (symbol from plugin)
+                                                  /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+__vector_15                                       /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+__vector_16                                       /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+__vector_17                                       /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+__vector_18                                       /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+__vector_19                                       /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+__vector_2                                        /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+__vector_3                                        /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+__vector_4                                        /var/folders/vn/lh8fp8wn313bb460zbdj4_ph0000gn/T//cc2goI6H.ltrans0.ltrans.o
+                                                  /var/folders/vn/lh8fp8wn313bb460zbdj4_ph0000gn/T//ccDU73Fu.o (symbol from plugin)
+                                                  /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+__vector_5                                        /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+__vector_6                                        /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+__vector_7                                        /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+__vector_8                                        /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+__vector_9                                        /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+__vector_default                                  /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+__vectors                                         /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+_exit                                             /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_exit.o)
+disp                                              /var/folders/vn/lh8fp8wn313bb460zbdj4_ph0000gn/T//ccDU73Fu.o (symbol from plugin)
+display                                           /var/folders/vn/lh8fp8wn313bb460zbdj4_ph0000gn/T//ccDU73Fu.o (symbol from plugin)
+exit                                              /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/avr25/libgcc.a(_exit.o)
+                                                  /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+main                                              /var/folders/vn/lh8fp8wn313bb460zbdj4_ph0000gn/T//cc2goI6H.ltrans0.ltrans.o
+                                                  /var/folders/vn/lh8fp8wn313bb460zbdj4_ph0000gn/T//ccDU73Fu.o (symbol from plugin)
+                                                  /usr/local/Cellar/avr-gcc/4.8.3/lib/gcc/avr/4.8.3/../../../../avr/lib/avr25/crttn88.o
+rocket                                            /var/folders/vn/lh8fp8wn313bb460zbdj4_ph0000gn/T//ccDU73Fu.o (symbol from plugin)
diff --git a/src/Hamming/Hamming.c b/src/Hamming/Hamming.c
new file mode 100644
index 0000000..cb1fba3
--- /dev/null
+++ b/src/Hamming/Hamming.c
@@ -0,0 +1,174 @@
+/*
+Hamming Error-Correcting Code (ECC)
+Optimized for avr-gcc 4.8.1 in Atmel AVR Studio 6.2
+August 12, 2014
+
+You should include Hamming.c, Hamming.h, and only one of the other Hamming files in your project.
+The other Hamming files implement the same methods in different ways, that may be better or worse for your needs.
+
+This was created for LoFi in the TheHackadayPrize contest.
+http://hackaday.io/project/1552-LoFi
+
+Copyright 2014 David Cook
+RobotRoom.com
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.
+*/
+
+#include <avr/pgmspace.h>
+
+#include "Hamming.h"
+
+/****************************/
+/*                          */
+/* Constants and structures */
+/*                          */
+/****************************/
+
+#ifndef null
+#define null ((void*) 0)
+#endif
+
+// If transmitting/writing only, you don't need to include this file.
+// If receiving/reading, then this provides the methods to correct bit errors.
+
+#define UNCORRECTABLE	0xFF
+#define ERROR_IN_PARITY	0xFE
+#define NO_ERROR		0x00
+
+
+/****************************/
+/*                          */
+/*     Global variables     */
+/*                          */
+/****************************/
+
+// Private table. Faster and more compact than multiple if statements.
+static const byte _hammingCorrect128Syndrome[16] PROGMEM =
+{
+	NO_ERROR,			// 0
+	ERROR_IN_PARITY,	// 1
+	ERROR_IN_PARITY,	// 2
+	0x01,				// 3
+	ERROR_IN_PARITY,	// 4
+	0x02,				// 5
+	0x04,				// 6
+	0x08,				// 7
+	ERROR_IN_PARITY,	// 8
+	0x10,				// 9
+	0x20,				// 10
+	0x40,				// 11
+	0x80,				// 12
+	UNCORRECTABLE,		// 13
+	UNCORRECTABLE,		// 14
+	UNCORRECTABLE,		// 15
+};
+
+/****************************/
+/*                          */
+/*      Private methods     */
+/*                          */
+/****************************/
+
+// Give a pointer to a received byte,
+// and given a nibble difference in parity (parity ^ calculated parity)
+// this will correct the received byte value if possible.
+// It returns the number of bits corrected:
+// 0 means no errors
+// 1 means one corrected error
+// 3 means corrections not possible
+static byte HammingCorrect128Syndrome(byte* value, byte syndrome)
+{
+	// Using only the lower nibble (& 0x0F), look up the bit
+	// to correct in a table
+	byte correction = pgm_read_byte(&(_hammingCorrect128Syndrome[syndrome & 0x0F]));
+
+	if (correction != NO_ERROR)
+	{
+		if (correction == UNCORRECTABLE || value == null)
+		{
+			return 3; // Non-recoverable error
+		}
+		else
+		{
+			if ( correction != ERROR_IN_PARITY)
+			{
+				*value ^= correction;
+			}
+
+			return 1; // 1-bit recoverable error;
+		}
+	}
+
+	return 0; // No errors
+}
+
+
+/****************************/
+/*                          */
+/*      Public  methods     */
+/*                          */
+/****************************/
+
+// Given a pointer to a received byte and the received parity (as a lower nibble),
+// this calculates what the parity should be and fixes the received value if needed.
+// It returns the number of bits corrected:
+// 0 means no errors
+// 1 means one corrected error
+// 3 means corrections not possible
+byte HammingCorrect128(byte* value, nibble parity)
+{
+	byte syndrome;
+
+	if (value == null)
+	{
+		return 3; // Non-recoverable error
+	}
+
+	syndrome = HammingCalculateParity128(*value) ^ parity;
+
+	if (syndrome != 0)
+	{
+		return HammingCorrect128Syndrome(value, syndrome);
+	}
+
+	return 0; // No errors
+}
+
+
+// Given a pointer to a first value and a pointer to a second value and
+// their combined given parity (lower nibble first parity, upper nibble second parity),
+// this calculates what the parity should be and fixes the values if needed.
+// It returns the number of bits corrected:
+// 0 means no errors
+// 1 means one corrected error
+// 2 means two corrected errors
+// 3 means corrections not possible
+byte HammingCorrect2416(byte* first, byte* second, byte parity)
+{
+	byte syndrome;
+
+	if (first == null || second == null)
+	{
+		return 3; // Non-recoverable error
+	}
+
+	syndrome = HammingCalculateParity2416(*first, *second) ^ parity;
+
+	if (syndrome != 0)
+	{
+		return HammingCorrect128Syndrome(first, syndrome) + HammingCorrect128Syndrome(second, syndrome >> 4);
+	}
+
+	return 0; // No errors
+}
diff --git a/src/Hamming/Hamming.h b/src/Hamming/Hamming.h
new file mode 100644
index 0000000..7778a59
--- /dev/null
+++ b/src/Hamming/Hamming.h
@@ -0,0 +1,68 @@
+/*
+Hamming Error-Correcting Code (ECC)
+Optimized for avr-gcc 4.8.1 in Atmel AVR Studio 6.2
+August 12, 2014
+
+You should include Hamming.c, Hamming.h, and only one of the other Hamming files in your project.
+The other Hamming files implement the same methods in different ways, that may be better or worse for your needs.
+
+This was created for LoFi in the TheHackadayPrize contest.
+http://hackaday.io/project/1552-LoFi
+
+Copyright 2014 David Cook
+RobotRoom.com
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.
+*/
+
+#ifndef _HAMMING_H
+#define _HAMMING_H
+
+#ifndef _AVR_H
+typedef unsigned char byte;
+typedef unsigned char nibble;
+#endif
+
+/**** These are needed to transmit and receive ****/
+
+// Given a byte to transmit, this returns the parity as a nibble
+nibble HammingCalculateParity128(byte value);
+
+// Given two bytes to transmit, this returns the parity
+// as a byte with the lower nibble being for the first byte,
+// and the upper nibble being for the second byte.
+byte HammingCalculateParity2416(byte first, byte second);
+
+
+
+/**** These are needed only to receive ****/
+
+// Given a pointer to a received byte and the received parity (as a lower nibble),
+// this calculates what the parity should be and fixes the received value if needed.
+// It returns the number of bits corrected:
+// 0 means no errors
+// 1 means one corrected error
+// 3 means corrections not possible
+byte HammingCorrect128(byte* value, nibble parity);
+
+// Given a pointer to a first value and a pointer to a second value and
+// their combined given parity (lower nibble first parity, upper nibble second parity),
+// this calculates what the parity should be and fixes the values if needed.
+// It returns the number of bits corrected:
+// 0 means no errors
+// 1 means one corrected error
+// 2 means two corrected errors
+// 3 means corrections not possible
+byte HammingCorrect2416(byte* first, byte* second, byte parity);
+
+#endif // _HAMMING_H
diff --git a/src/Hamming/HammingCalculateParityFast.c b/src/Hamming/HammingCalculateParityFast.c
new file mode 100644
index 0000000..6cc5df6
--- /dev/null
+++ b/src/Hamming/HammingCalculateParityFast.c
@@ -0,0 +1,67 @@
+/*
+Hamming Error-Correcting Code (ECC)
+Optimized for avr-gcc 4.8.1 in Atmel AVR Studio 6.2
+August 12, 2014
+
+You should include Hamming.c, Hamming.h, and only one of the other Hamming files in your project.
+The other Hamming files implement the same methods in different ways, that may be better or worse for your needs.
+
+This was created for LoFi in the TheHackadayPrize contest.
+http://hackaday.io/project/1552-LoFi
+
+Copyright 2014 David Cook
+RobotRoom.com
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.
+*/
+
+#include <avr/pgmspace.h>
+
+#include "Hamming.h"
+
+
+// This contains all of the precalculated parity values for a byte (8 bits).
+// This is very fast, but takes up more program space than calculating on the fly.
+static const byte _hammingCalculateParityFast128[256] PROGMEM =
+{
+	 0,  3,  5,  6,  6,  5,  3,  0,  7,  4,  2,  1,  1,  2,  4,  7,
+	 9, 10, 12, 15, 15, 12, 10,  9, 14, 13, 11,  8,  8, 11, 13, 14,
+	10,  9, 15, 12, 12, 15,  9, 10, 13, 14,  8, 11, 11,  8, 14, 13,
+	 3,  0,  6,  5,  5,  6,  0,  3,  4,  7,  1,  2,  2,  1,  7,  4,
+	11,  8, 14, 13, 13, 14,  8, 11, 12, 15,  9, 10, 10,  9, 15, 12,
+	 2,  1,  7,  4,  4,  7,  1,  2,  5,  6,  0,  3,  3,  0,  6,  5,
+	 1,  2,  4,  7,  7,  4,  2,  1,  6,  5,  3,  0,  0,  3,  5,  6,
+	 8, 11, 13, 14, 14, 13, 11,  8, 15, 12, 10,  9,  9, 10, 12, 15,
+	12, 15,  9, 10, 10,  9, 15, 12, 11,  8, 14, 13, 13, 14,  8, 11,
+	 5,  6,  0,  3,  3,  0,  6,  5,  2,  1,  7,  4,  4,  7,  1,  2,
+	 6,  5,  3,  0,  0,  3,  5,  6,  1,  2,  4,  7,  7,  4,  2,  1,
+	15, 12, 10,  9,  9, 10, 12, 15,  8, 11, 13, 14, 14, 13, 11,  8,
+	 7,  4,  2,  1,  1,  2,  4,  7,  0,  3,  5,  6,  6,  5,  3,  0,
+	14, 13, 11,  8,  8, 11, 13, 14,  9, 10, 12, 15, 15, 12, 10,  9,
+	13, 14,  8, 11, 11,  8, 14, 13, 10,  9, 15, 12, 12, 15,  9, 10,
+	 4,  7,  1,  2,  2,  1,  7,  4,  3,  0,  6,  5,  5,  6,  0,  3,
+};
+
+// Given a byte to transmit, this returns the parity as a nibble
+nibble HammingCalculateParity128(byte value)
+{
+	return pgm_read_byte(&(_hammingCalculateParityFast128[value]));
+}
+
+// Given two bytes to transmit, this returns the parity
+// as a byte with the lower nibble being for the first byte,
+// and the upper nibble being for the second byte.
+byte HammingCalculateParity2416(byte first, byte second)
+{
+	return (pgm_read_byte(&(_hammingCalculateParityFast128[second]))<<4) | pgm_read_byte(&(_hammingCalculateParityFast128[first]));
+}
diff --git a/src/Hamming/HammingCalculateParitySmall.c b/src/Hamming/HammingCalculateParitySmall.c
new file mode 100644
index 0000000..d446f8f
--- /dev/null
+++ b/src/Hamming/HammingCalculateParitySmall.c
@@ -0,0 +1,99 @@
+/*
+Hamming Error-Correcting Code (ECC)
+Optimized for avr-gcc 4.8.1 in Atmel AVR Studio 6.2
+August 12, 2014
+
+You should include Hamming.c, Hamming.h, and only one of the other Hamming files in your project.
+The other Hamming files implement the same methods in different ways, that may be better or worse for your needs.
+
+This was created for LoFi in the TheHackadayPrize contest.
+http://hackaday.io/project/1552-LoFi
+
+Copyright 2014 David Cook
+RobotRoom.com
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.
+*/
+
+#include "Hamming.h"
+
+/****************************/
+/*                          */
+/*      Public  methods     */
+/*                          */
+/****************************/
+
+// This is slower than using a table, but faster than
+// using the textbook method.
+
+// Given a byte to transmit, this returns the parity as a nibble
+nibble HammingCalculateParity128(byte value)
+{
+	// Exclusive OR is associative and commutative, so order of operations and values does not matter.
+	nibble parity;
+
+	if ( ( value & 1 ) != 0 )
+	{
+		parity = 0x3;
+	}
+	else
+	{
+		parity = 0x0;
+	}
+
+	if ( ( value & 2 ) != 0 )
+	{
+		parity ^= 0x5;
+	}
+
+	if ( ( value & 4 ) != 0 )
+	{
+		parity ^= 0x6;
+	}
+
+	if ( ( value & 8 ) != 0 )
+	{
+		parity ^= 0x7;
+	}
+
+	if ( ( value & 16 ) != 0 )
+	{
+		parity ^= 0x9;
+	}
+
+	if ( ( value & 32 ) != 0 )
+	{
+		parity ^= 0xA;
+	}
+
+	if ( ( value & 64 ) != 0 )
+	{
+		parity ^= 0xB;
+	}
+
+	if ( ( value & 128 ) != 0 )
+	{
+		parity ^= 0xC;
+	}
+
+	return parity;
+}
+
+// Given two bytes to transmit, this returns the parity
+// as a byte with the lower nibble being for the first byte,
+// and the upper nibble being for the second byte.
+byte HammingCalculateParity2416(byte first, byte second)
+{
+	return (HammingCalculateParity128(second) << 4) | HammingCalculateParity128(first);
+}
+
diff --git a/src/Hamming/HammingCalculateParitySmallAndFast.c b/src/Hamming/HammingCalculateParitySmallAndFast.c
new file mode 100644
index 0000000..ad27bf8
--- /dev/null
+++ b/src/Hamming/HammingCalculateParitySmallAndFast.c
@@ -0,0 +1,64 @@
+/*
+Hamming Error-Correcting Code (ECC)
+Optimized for avr-gcc 4.8.1 in Atmel AVR Studio 6.2
+August 12, 2014
+
+You should include Hamming.c, Hamming.h, and only one of the other Hamming files in your project.
+The other Hamming files implement the same methods in different ways, that may be better or worse for your needs.
+
+This was created for LoFi in the TheHackadayPrize contest.
+http://hackaday.io/project/1552-LoFi
+
+Copyright 2014 David Cook
+RobotRoom.com
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.
+*/
+
+#include <avr/pgmspace.h>
+
+#include "Hamming.h"
+
+/****************************/
+/*                          */
+/*     Global variables     */
+/*                          */
+/****************************/
+
+// This contains all of the precalculated parity values for a nibble (4 bits).
+static const byte _hammingCalculateParityLowNibble[] PROGMEM =
+{ 0,  3,  5,  6,  6,  5,  3,  0,  7,  4,  2,  1,  1,  2,  4,  7 };
+
+static const byte _hammingCalculateParityHighNibble[] PROGMEM =
+{ 0,  9, 10,  3, 11,  2,  1,  8, 12,  5,  6, 15,  7, 14, 13,  4 };
+
+
+/****************************/
+/*                          */
+/*      Public  methods     */
+/*                          */
+/****************************/
+
+// Given a byte to transmit, this returns the parity as a nibble
+nibble HammingCalculateParity128(byte value)
+{
+	return pgm_read_byte(&(_hammingCalculateParityLowNibble[value&0x0F])) ^ pgm_read_byte(&(_hammingCalculateParityHighNibble[value >> 4]));
+}
+
+// Given two bytes to transmit, this returns the parity
+// as a byte with the lower nibble being for the first byte,
+// and the upper nibble being for the second byte.
+byte HammingCalculateParity2416(byte first, byte second)
+{
+	return HammingCalculateParity128(second) << 4 | HammingCalculateParity128(first);
+}
diff --git a/src/Hamming/HammingCalculateParityTextbook.c b/src/Hamming/HammingCalculateParityTextbook.c
new file mode 100644
index 0000000..08e5cca
--- /dev/null
+++ b/src/Hamming/HammingCalculateParityTextbook.c
@@ -0,0 +1,100 @@
+/*
+Hamming Error-Correcting Code (ECC)
+Optimized for avr-gcc 4.8.1 in Atmel AVR Studio 6.2
+August 12, 2014
+
+You should include Hamming.c, Hamming.h, and only one of the other Hamming files in your project.
+The other Hamming files implement the same methods in different ways, that may be better or worse for your needs.
+
+This was created for LoFi in the TheHackadayPrize contest.
+http://hackaday.io/project/1552-LoFi
+
+Copyright 2014 David Cook
+RobotRoom.com
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.
+*/
+
+#include "Hamming.h"
+
+// This performs poorly on a processor that can't do multiple shifts in one instruction
+#define BitToBool(byte, n) ((byte>>(n-1)) & 1)
+
+// This is a private method that calculates half the parity
+// while shifting over any previously calculated parity for another byte.
+// This was designed for processors that cannot shift more than one bit place at a time
+nibble HammingCalculateParity2416Half(byte value, byte paritySoFar)
+{
+	// Calculate the most significant bit
+	paritySoFar |= BitToBool(value, 5) ^ BitToBool(value, 6) ^ BitToBool(value, 7) ^ BitToBool(value, 8);
+	// Shift it over
+	paritySoFar <<= 1;
+
+	// Calculate the next most significant bit
+	paritySoFar |= BitToBool(value, 2) ^ BitToBool(value, 3) ^ BitToBool(value, 4) ^ BitToBool(value, 8);
+	// Shift it over, as well as the previously calculated bit
+	paritySoFar <<= 1;
+
+	// Calculate the next most significant bit
+	paritySoFar |= BitToBool(value, 1) ^ BitToBool(value, 3) ^ BitToBool(value, 4) ^ BitToBool(value, 6) ^ BitToBool(value, 7);
+	// Shift it over, as well as the previously calculated bits
+	paritySoFar <<= 1;
+
+	// Calculate the least significant bit
+	paritySoFar |= BitToBool(value, 1) ^ BitToBool(value, 2) ^ BitToBool(value, 4) ^ BitToBool(value, 5) ^ BitToBool(value, 7);
+
+	return paritySoFar;
+}
+
+// Given a byte to transmit, this returns the parity as a nibble
+nibble HammingCalculateParity128(byte value)
+{
+	return HammingCalculateParity2416Half(value, 0);
+}
+
+// If your processor can shift multiple bit places in a single instruction, then set this to 1.
+// It will be twice as fast.
+// If your processor cannot, then set this to 0, otherwise it will be slow and large.
+#define CPU_HAS_MULTIPLE_SHIFT_INSTRUCTION 0
+
+#if CPU_HAS_MULTIPLE_SHIFT_INSTRUCTION
+// Given two bytes to transmit, this returns the parity
+// as a byte with the lower nibble being for the first byte,
+// and the upper nibble being for the second byte.
+byte HammingCalculateParity2416(byte first, byte second)
+{
+	// This is the textbook way to calculate hamming parity.
+	return	((BitToBool(first, 1) ^ BitToBool(first, 2) ^ BitToBool(first, 4) ^ BitToBool(first, 5) ^ BitToBool(first, 7))) +
+			((BitToBool(first, 1) ^ BitToBool(first, 3) ^ BitToBool(first, 4) ^ BitToBool(first, 6) ^ BitToBool(first, 7))<<1) +
+			((BitToBool(first, 2) ^ BitToBool(first, 3) ^ BitToBool(first, 4) ^ BitToBool(first, 8))<<2) +
+			((BitToBool(first, 5) ^ BitToBool(first, 6) ^ BitToBool(first, 7) ^ BitToBool(first, 8))<<3) +
+
+			((BitToBool(second, 1) ^ BitToBool(second, 2) ^ BitToBool(second, 4) ^ BitToBool(second, 5) ^ BitToBool(second, 7))<<4) +
+			((BitToBool(second, 1) ^ BitToBool(second, 3) ^ BitToBool(second, 4) ^ BitToBool(second, 6) ^ BitToBool(second, 7))<<5) +
+			((BitToBool(second, 2) ^ BitToBool(second, 3) ^ BitToBool(second, 4) ^ BitToBool(second, 8))<<6) +
+			((BitToBool(second, 5) ^ BitToBool(second, 6) ^ BitToBool(second, 7) ^ BitToBool(second, 8))<<7);
+}
+#else
+// Given two bytes to transmit, this returns the parity
+// as a byte with the lower nibble being for the first byte,
+// and the upper nibble being for the second byte.
+byte HammingCalculateParity2416(byte first, byte second)
+{
+	// This makes two calls, one for each byte.
+	// It passes the result of the second byte into the calculation for the first
+	// such that the four shift instructions and the 'or' instruction are free.
+	return HammingCalculateParity2416Half(first, HammingCalculateParity2416Half(second, 0) << 1);
+}
+#endif
+
+
diff --git a/src/Hamming/LICENSE b/src/Hamming/LICENSE
new file mode 100644
index 0000000..5c304d1
--- /dev/null
+++ b/src/Hamming/LICENSE
@@ -0,0 +1,201 @@
+Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "{}"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright {yyyy} {name of copyright owner}
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.
diff --git a/src/Hamming/README.md b/src/Hamming/README.md
new file mode 100644
index 0000000..b6b8269
--- /dev/null
+++ b/src/Hamming/README.md
@@ -0,0 +1,4 @@
+Hamming
+=======
+
+Hamming(12,8) and (24,16) error-correcting code (ECC) in avr-gcc
diff --git a/src/display.cc b/src/display.cc
new file mode 100644
index 0000000..dfe4c1f
--- /dev/null
+++ b/src/display.cc
@@ -0,0 +1,236 @@
+/*
+ * Copyright (C) 2016 by Daniel Friesel
+ *
+ * License: You may use, redistribute and/or modify this file under the terms
+ * of either:
+ * * The GNU LGPL v3 (see COPYING and COPYING.LESSER), or
+ * * The 3-clause BSD License (see COPYING.BSD)
+ *
+ */
+
+#include <avr/io.h>
+#include <avr/interrupt.h>
+#include <avr/pgmspace.h>
+#include <stdlib.h>
+
+#include "display.h"
+#include "font.h"
+#include "storage.h"
+
+Display display;
+
+Display::Display()
+{
+	char_pos = -1;
+}
+
+void Display::disable()
+{
+	TIMSK0 &= ~_BV(TOIE0);
+	PORTB = 0;
+	PORTD = 0;
+}
+
+void Display::enable()
+{
+	// Ports B and D drive the dot matrix display -> set all as output
+	DDRB = 0xff;
+	DDRD = 0xff;
+
+	// Enable 8bit counter with prescaler=8 (-> timer frequency = 1MHz)
+	TCCR0A = _BV(CS01);
+	// raise timer interrupt on counter overflow (-> interrupt frequency = ~4kHz)
+	TIMSK0 = _BV(TOIE0);
+}
+
+void Display::multiplex()
+{
+	/*
+	 * To avoid flickering, do not put any code (or expensive index
+	 * calculations) between the following three lines.
+	 */
+	PORTB = 0;
+	PORTD = disp_buf[active_col];
+	PORTB = _BV(active_col);
+
+	if (++active_col == 8) {
+		active_col = 0;
+		if (++update_cnt == update_threshold) {
+			update_cnt = 0;
+			need_update = 1;
+		}
+	}
+}
+
+void Display::update() {
+	uint8_t i, glyph_len;
+	uint8_t *glyph_addr;
+	if (need_update) {
+		need_update = 0;
+
+		if (status == RUNNING) {
+			if (current_anim->type == AnimationType::TEXT) {
+
+				/*
+				 * Scroll display contents to the left/right
+				 */
+				if (current_anim->direction == 0) {
+					for (i = 0; i < 7; i++) {
+						disp_buf[i] = disp_buf[i+1];
+					}
+				} else if (current_anim->direction == 1) {
+					for (i = 7; i > 0; i--) {
+						disp_buf[i] = disp_buf[i-1];
+					}
+				}
+
+				/*
+				 * Load current character
+				 */
+				glyph_addr = (uint8_t *)pgm_read_ptr(&font[current_anim->data[str_pos]]);
+				glyph_len = pgm_read_byte(&glyph_addr[0]);
+				char_pos++;
+
+				if (char_pos > glyph_len) {
+					char_pos = 0;
+					if (current_anim->direction == 0)
+						str_pos++;
+					else
+						str_pos--; // may underflow, but that's okay
+				}
+
+				/*
+				 * Append one character column (or whitespace if we are
+				 * between two characters)
+				 */
+				if (current_anim->direction == 0) {
+					if (char_pos == 0) {
+						disp_buf[7] = 0xff; // whitespace
+					} else {
+						disp_buf[7] = ~pgm_read_byte(&glyph_addr[char_pos]);
+					}
+				} else {
+					if (char_pos == 0) {
+						disp_buf[0] = 0xff; // whitespace
+					} else {
+						disp_buf[0] = ~pgm_read_byte(&glyph_addr[glyph_len - char_pos + 1]);
+					}
+				}
+
+			} else if (current_anim->type == AnimationType::FRAMES) {
+				for (i = 0; i < 8; i++) {
+					disp_buf[i] = ~current_anim->data[str_pos+i];
+				}
+				str_pos += 8;
+			}
+
+			if (current_anim->direction == 0) {
+				/*
+				 * Check whether we reached the end of the pattern
+				 * (that is, we're in the last chunk and reached the
+				 * remaining pattern length)
+				 */
+				if ((str_chunk == ((current_anim->length - 1) / 128))
+						&& (str_pos > ((current_anim->length - 1) % 128))) {
+					str_chunk = 0;
+					str_pos = 0;
+					if (current_anim->delay > 0) {
+						status = PAUSED;
+						update_threshold = 244;
+					}
+					if (current_anim->length > 128) {
+						storage.loadChunk(str_chunk, current_anim->data);
+					}
+				/*
+				 * Otherwise, check whether the pattern is split into
+				 * several chunks and we reached the end of the chunk
+				 * kept in current_anim->data
+				 */
+				} else if ((current_anim->length > 128) && (str_pos >= 128)) {
+					str_pos = 0;
+					str_chunk++;
+					storage.loadChunk(str_chunk, current_anim->data);
+				}
+			} else {
+				/*
+				 * In this branch we keep doing str_pos--, so check for
+				 * underflow
+				 */
+				if (str_pos >= 128) {
+					/*
+					 * Check whether we reached the end of the pattern
+					 * (and whether we need to load a new chunk)
+					 */
+					if (str_chunk == 0) {
+						if (current_anim->length > 128) {
+							str_chunk = (current_anim->length - 1) / 128;
+							storage.loadChunk(str_chunk, current_anim->data);
+						}
+						if (current_anim->delay > 0) {
+							str_pos = 0;
+							status = PAUSED;
+							update_threshold = 244;
+						} else {
+							str_pos = (current_anim->length - 1) % 128;
+						}
+					/*
+					 * Otherwise, we reached the end of the active chunk
+					 */
+					} else {
+						str_chunk--;
+						storage.loadChunk(str_chunk, current_anim->data);
+						str_pos = 127;
+					}
+				}
+			}
+		} else if (status == PAUSED) {
+			str_pos++;
+			if (str_pos >= current_anim->delay) {
+				if (current_anim->direction == 0)
+					str_pos = 0;
+				else if (current_anim->length <= 128)
+					str_pos = current_anim->length - 1;
+				else
+					str_pos = (current_anim->length - 1) % 128;
+				status = RUNNING;
+				update_threshold = current_anim->speed;
+			}
+		}
+	}
+}
+
+void Display::reset()
+{
+	for (uint8_t i = 0; i < 8; i++)
+		disp_buf[i] = 0xff;
+	update_cnt = 0;
+	str_pos = 0;
+	str_chunk = 0;
+	char_pos = -1;
+	need_update = 1;
+	status = RUNNING;
+}
+
+void Display::show(animation_t *anim)
+{
+	current_anim = anim;
+	reset();
+	update_threshold = current_anim->speed;
+	if (current_anim->direction == 1) {
+		if (current_anim->length > 128) {
+			str_chunk = (current_anim->length - 1) / 128;
+			storage.loadChunk(str_chunk, current_anim->data);
+		}
+		str_pos = (current_anim->length - 1) % 128;
+	}
+}
+
+/*
+ * Current configuration:
+ * One interrupt per 256 microseconds. The whole display is refreshed every
+ * 2048us, giving a refresh rate of ~500Hz
+ */
+ISR(TIMER0_OVF_vect)
+{
+	display.multiplex();
+}
diff --git a/src/display.h b/src/display.h
new file mode 100644
index 0000000..ef133a0
--- /dev/null
+++ b/src/display.h
@@ -0,0 +1,223 @@
+/*
+ * Copyright (C) 2016 by Daniel Friesel
+ *
+ * License: You may use, redistribute and/or modify this file under the terms
+ * of either:
+ * * The GNU LGPL v3 (see COPYING and COPYING.LESSER), or
+ * * The 3-clause BSD License (see COPYING.BSD)
+ *
+ */
+
+#include <avr/io.h>
+#include <stdlib.h>
+
+/**
+ * Describes the type of an animation object. The Storage class reserves four
+ * bits for the animation type, so up to 16 types are supported.
+ */
+enum class AnimationType : uint8_t {
+	TEXT = 1,
+	FRAMES = 2
+};
+
+/**
+ * Generic struct for anything which can be displayed, e.g. texts or
+ * sequences of frames.
+ */
+struct animation {
+	/**
+	 * Type of patern/animation described in this struct. Controls the
+	 * behaviour of Display::multiplex() and Display::update().
+	 */
+	AnimationType type;
+
+	/**
+	 * Length of animation in bytes. Also controls the behaviour of
+	 * Display::update().
+	 *
+	 * For length <= 128, the whole animation is stored in data and
+	 * Display::update() simply traverses the data array.
+	 *
+	 * For length > 128, only up to 128 bytes of animation data are stored
+	 * in data. When Display::update() reaches the end of the array, it will
+	 * use Storage::loadChunk() to load the next 128 byte chunk of animation
+	 * data into the data array.
+	 */
+	uint16_t length;
+
+	/**
+	 * * If type == AnimationType::TEXT: Text scroll speed in columns per TODO
+	 * * If type == AnimationType::FRAMES: Frames per TODO
+	 */
+	uint8_t speed;
+
+	/**
+	 * Delay after the last text symbol / animation frame.
+	 */
+	uint8_t delay;
+
+	/**
+	 * Scroll mode / direction. Must be set to 0 if type != TEXT.
+	 */
+	uint8_t direction;
+
+	/**
+	 * * If type == AnimationType::TEXT: pointer to an arary containing the
+	 *   animation text in standard ASCII format (+ special font chars)
+	 * * If type == AnimationType::FRAMES: Frame array. Each element encodes
+	 *   a display column (starting with the leftmost one), each group of
+	 *   eight elements is a frame.
+	 *
+	 * The data array must always hold at least 128 elements.
+	 */
+	uint8_t *data;
+};
+
+typedef struct animation animation_t;
+
+/**
+ * Controls the display. Handles multiplexing, scrolling and supports loading
+ * arbitrary animations. Also handles partial animations and chunk loading.
+ */
+class Display {
+	private:
+
+		/**
+		 * The currently active animation
+		 */
+		animation_t *current_anim;
+
+		/**
+		 * Internal display update counter. Incremented by multiplex().
+		 * update() is called (and the counter reset) whenever
+		 * update_cnt == need_update.
+		 */
+		uint8_t update_cnt;
+
+		/**
+		 * Set to a true value by multiplex() if an update (that is,
+		 * a scroll step or a new frame) is needed. Checked and reset to
+		 * false by update().
+		 */
+		uint8_t need_update;
+
+		/**
+		 * Number of frames after which update() is called. This value
+		 * holds either the current animation's speed or its delay.
+		 */
+		uint8_t update_threshold;
+
+		/**
+		 * The currently active column in multiplex()
+		 */
+		uint8_t active_col;
+
+		/**
+		 * The current display content which multiplex() will show
+		 */
+		uint8_t disp_buf[8];
+
+		/**
+		 * The current position inside current_anim->data. For a TEXT
+		 * animation, this indicates the currently active character.
+		 * In case of FRAMES, it indicates the leftmost column of an
+		 * eight-column frame.
+		 *
+		 * This variable is also used as delay counter for status == PAUSED,
+		 * so it must be re-initialized when the pause is over.
+		 */
+		uint8_t str_pos;
+
+		/**
+		 * The currently active animation chunk. For an animation which is
+		 * not longer than 128 bytes, this will always read 0. Otherwise,
+		 * it indicates the offset in 128 byte-chunks from the start of the
+		 * animation which is currently held in memory. So, str_chunk == 1
+		 * means current->anim_data contains animation bytes 129 to 256,
+		 * and so on. The current position in the complete animation is
+		 * str_chunk * 128 + str_pos.
+		 */
+		uint8_t str_chunk;
+
+		/**
+		 * If current_anim->type == TEXT: The column of the character
+		 * pointed to by str_pos which was last added to the display.
+		 *
+		 * For current_anim->direction == 0, this refers to the character's
+		 * left border and counts from 0 onwards. so char_pos == 0 means the
+		 * leftmost column of the character was last added to the display.
+		 *
+		 * For current_anim->direction == 1, this refers to the character's
+		 * right border and also counts from 0 onwards, so char_pos == 0
+		 * means the rightmost column of the character was last added to the
+		 * display.
+		 */
+		int8_t char_pos;
+
+		enum AnimationStatus : uint8_t {
+			RUNNING,
+			SCROLL_BACK,
+			PAUSED
+		};
+
+		/**
+		 * The current animation status: RUNNING (text/frames are being
+		 * displayed) or PAUSED (the display isn't changed until the
+		 * delay specified by current_anim->delay has passed)
+		 */
+		AnimationStatus status;
+
+	public:
+		Display();
+
+		/**
+		 * Enables the display driver.
+		 * Configures ports B and D as output and enables the display
+		 * timer and corresponding interrupt.
+		 */
+		void enable(void);
+
+		/**
+		 * Disables the display driver.
+		 * Turns off both the display itself and the display timer.
+		 */
+		void disable(void);
+
+		/**
+		 * Draws a single display column. Called every 256 microseconds
+		 * by the timer interrupt (TIMER0_OVF_vect), resulting in
+		 * a display refresh rate of ~500Hz (one refresh per 2048µs)
+		 */
+		void multiplex(void);
+
+		/**
+		 * Reset display and animation state. Fills the screen with "black"
+		 * (that is, no active pixels) and sets the animation offset to zero.
+		 */
+		void reset(void);
+
+		/**
+		 * Update display content.
+		 * Checks current_anim->speed and current_anim->type and scrolls
+		 * the text / advances a frame when appropriate. Also uses
+		 * Storage::loadChunk() to load the next 128 pattern bytes if
+		 * current_anim->length is greater than 128 and the end of the
+		 * 128 byte pattern buffer is reached.
+		 */
+		void update(void);
+
+		/**
+		 * Sets the active animation to be shown on the display. Automatically
+		 * calls reset(). If direction == 1, uses Storage::loadChunk() to
+		 * load the last 128 byte-chunk of anim (so that the text can start
+		 * scrolling from its last position). If direction == 0, the first
+		 * 128 bytes of animation data are expected to already be present in
+		 * anim->data.
+		 *
+		 * @param anim active animation. Note that the data is not copied,
+		 *        so anim has to be kept in memory until a new one is loaded
+		 */
+		void show(animation_t *anim);
+};
+
+extern Display display;
diff --git a/src/fecmodem.cc b/src/fecmodem.cc
new file mode 100644
index 0000000..a75c27b
--- /dev/null
+++ b/src/fecmodem.cc
@@ -0,0 +1,96 @@
+/*
+ * Copyright (C) 2016 by Daniel Friesel
+ *
+ * License: You may use, redistribute and/or modify this file under the terms
+ * of either:
+ * * The GNU LGPL v3 (see COPYING and COPYING.LESSER), or
+ * * The 3-clause BSD License (see COPYING.BSD)
+ *
+ */
+
+#include <avr/io.h>
+#include <stdlib.h>
+#include "fecmodem.h"
+
+uint8_t FECModem::parity128(uint8_t byte)
+{
+	return pgm_read_byte(&hammingParityLow[byte & 0x0f]) ^ pgm_read_byte(&hammingParityHigh[byte >> 4]);
+}
+
+uint8_t FECModem::parity2416(uint8_t byte1, uint8_t byte2)
+{
+	return parity128(byte1) | (parity128(byte2) << 4);
+}
+
+uint8_t FECModem::correct128(uint8_t *byte, uint8_t err)
+{
+	uint8_t result = pgm_read_byte(&hammingParityCheck[err & 0x0f]);
+
+	if (result != NO_ERROR) {
+		if (byte == NULL)
+			return 3;
+		if (result == UNCORRECTABLE) {
+			*byte = 0;
+			return 3;
+		}
+		if (result != ERROR_IN_PARITY) {
+			*byte ^= result;
+		}
+		return 1;
+	}
+	return 0;
+}
+
+uint8_t FECModem::hamming2416(uint8_t *byte1, uint8_t *byte2, uint8_t parity)
+{
+	uint8_t err;
+
+	if (byte1 == NULL || byte2 == NULL) {
+		return 3;
+	}
+
+	err = parity2416(*byte1, *byte2) ^ parity;
+
+	if (err) {
+		return correct128(byte1, err) + correct128(byte2, err >> 4);
+	}
+
+	return 0;
+}
+
+void FECModem::enable()
+{
+	this->Modem::enable();
+	hammingState = FIRST_BYTE;
+}
+
+uint8_t FECModem::buffer_available()
+{
+//   XXX this reset implementation is _completely_ broken
+//	if (newTransmission())
+//		hammingState = FIRST_BYTE;
+	if (this->Modem::buffer_available() >= 3)
+		return 2;
+	if (hammingState == SECOND_BYTE)
+		return 1;
+	return 0;
+}
+
+uint8_t FECModem::buffer_get()
+{
+	uint8_t byte1, parity;
+	if (hammingState == SECOND_BYTE) {
+		hammingState = FIRST_BYTE;
+		return buf_byte;
+	}
+	hammingState = SECOND_BYTE;
+	byte1 = this->Modem::buffer_get();
+	buf_byte = this->Modem::buffer_get();
+	parity = this->Modem::buffer_get();
+
+	hamming2416(&byte1, &buf_byte, parity);
+
+	return byte1;
+}
+
+FECModem modem;
diff --git a/src/fecmodem.h b/src/fecmodem.h
new file mode 100644
index 0000000..9d43fa3
--- /dev/null
+++ b/src/fecmodem.h
@@ -0,0 +1,67 @@
+/*
+ * Copyright (C) 2016 by Daniel Friesel
+ *
+ * License: You may use, redistribute and/or modify this file under the terms
+ * of either:
+ * * The GNU LGPL v3 (see COPYING and COPYING.LESSER), or
+ * * The 3-clause BSD License (see COPYING.BSD)
+ *
+ */
+
+#include <avr/io.h>
+#include <stdlib.h>
+
+#ifndef FECMODEM_H_
+#define FECMODEM_H_
+
+#include "hamming.h"
+#include "modem.h"
+
+/**
+ * Receive-only modem with forward error correction.
+ * Uses the Modem class to read raw modem data and uses the Hamming 2416
+ * algorithm to detect and, if possible, correct transmission errors.
+ * Exposes a global modem object for convenience.
+ */
+class FECModem : public Modem {
+	private:
+		enum HammingState : uint8_t {
+			FIRST_BYTE,
+			SECOND_BYTE
+		};
+		HammingState hammingState;
+		uint8_t buf_byte;
+
+		uint8_t parity128(uint8_t byte);
+		uint8_t parity2416(uint8_t byte1, uint8_t byte2);
+		uint8_t correct128(uint8_t *byte, uint8_t parity);
+		uint8_t hamming2416(uint8_t *byte1, uint8_t *byte2, uint8_t parity);
+	public:
+		FECModem() : Modem() {};
+
+		/**
+		 * Enable the modem. Resets the internal Hamming state and calls
+		 * Modem::enable().
+		 */
+		void enable(void);
+
+		/**
+		 * Checks if there are unprocessed bytes in the receive buffer.
+		 * Parity bytes are accounted for, so if three raw bytes (two data,
+		 * one parity) were received by Modem::receive(), this function will
+		 * return 2.
+		 * @return number of unprocessed data bytes
+		 */
+		uint8_t buffer_available(void);
+
+		/**
+		 * Get next byte from the receive buffer.
+		 * @return received byte (0 if it contained uncorrectable errors
+		 *         or the buffer is empty)
+		 */
+		uint8_t buffer_get(void);
+};
+
+extern FECModem modem;
+
+#endif /* FECMODEM_H_ */
diff --git a/src/font.h b/src/font.h
new file mode 100644
index 0000000..1cbf20b
--- /dev/null
+++ b/src/font.h
@@ -0,0 +1,244 @@
+#ifndef FONT_H_
+#define FONT_H_
+
+#include <avr/pgmspace.h>
+
+/* 
+ * Font face is based on "Pixel Operator 8" which is licensed under the
+ * SIL Open Font License 1.1 (compatible to GPL)
+ */
+
+typedef const unsigned char* glyph_t;
+
+const unsigned char PROGMEM chr_001[] = {0x08,0x00,0x04,0x22,0x02,0x22,0x04,0x00,0x00}; // happy smiley
+const unsigned char PROGMEM chr_002[] = {0x08,0x00,0x02,0x24,0x04,0x24,0x02,0x00,0x00}; // sad smiley
+const unsigned char PROGMEM chr_003[] = {0x05,0x18,0x24,0x12,0x24,0x18}; // heart
+const unsigned char PROGMEM chr_032[] = {0x03,0x00,0x00,0x00}; // <space>
+const unsigned char PROGMEM chr_033[] = {0x01,0x7D}; // !
+const unsigned char PROGMEM chr_034[] = {0x04,0x30,0x40,0x30,0x40}; // "
+const unsigned char PROGMEM chr_035[] = {0x06,0x12,0x3F,0x12,0x12,0x3F,0x12}; // #
+const unsigned char PROGMEM chr_036[] = {0x05,0x12,0x2A,0x7F,0x2A,0x24}; // $
+const unsigned char PROGMEM chr_037[] = {0x07,0x30,0x4A,0x34,0x08,0x16,0x29,0x06}; // %
+const unsigned char PROGMEM chr_038[] = {0x05,0x36,0x49,0x49,0x49,0x27}; // &
+const unsigned char PROGMEM chr_039[] = {0x01,0x70}; // '
+const unsigned char PROGMEM chr_040[] = {0x03,0x1C,0x22,0x41}; // (
+const unsigned char PROGMEM chr_041[] = {0x03,0x41,0x22,0x1C}; // )
+const unsigned char PROGMEM chr_042[] = {0x05,0x28,0x10,0x7C,0x10,0x28}; // *
+const unsigned char PROGMEM chr_043[] = {0x05,0x08,0x08,0x3E,0x08,0x08}; // +
+const unsigned char PROGMEM chr_044[] = {0x02,0x01,0x02}; // ,
+const unsigned char PROGMEM chr_045[] = {0x05,0x08,0x08,0x08,0x08,0x08}; // -
+const unsigned char PROGMEM chr_046[] = {0x01,0x01}; // .
+const unsigned char PROGMEM chr_047[] = {0x03,0x03,0x1C,0x60}; // /
+const unsigned char PROGMEM chr_048[] = {0x05,0x3E,0x45,0x49,0x51,0x3E}; // 0
+const unsigned char PROGMEM chr_049[] = {0x03,0x10,0x20,0x7F}; // 1
+const unsigned char PROGMEM chr_050[] = {0x05,0x21,0x43,0x45,0x49,0x31}; // 2
+const unsigned char PROGMEM chr_051[] = {0x05,0x22,0x41,0x49,0x49,0x36}; // 3
+const unsigned char PROGMEM chr_052[] = {0x05,0x0C,0x14,0x24,0x44,0x7F}; // 4
+const unsigned char PROGMEM chr_053[] = {0x05,0x72,0x51,0x51,0x51,0x4E}; // 5
+const unsigned char PROGMEM chr_054[] = {0x05,0x3E,0x49,0x49,0x49,0x26}; // 6
+const unsigned char PROGMEM chr_055[] = {0x05,0x43,0x44,0x48,0x50,0x60}; // 7
+const unsigned char PROGMEM chr_056[] = {0x05,0x36,0x49,0x49,0x49,0x36}; // 8
+const unsigned char PROGMEM chr_057[] = {0x05,0x32,0x49,0x49,0x49,0x3E}; // 9
+const unsigned char PROGMEM chr_058[] = {0x01,0x12}; // :
+const unsigned char PROGMEM chr_059[] = {0x02,0x01,0x12}; // ;
+const unsigned char PROGMEM chr_060[] = {0x03,0x08,0x14,0x22}; // <
+const unsigned char PROGMEM chr_061[] = {0x05,0x14,0x14,0x14,0x14,0x14}; // =
+const unsigned char PROGMEM chr_062[] = {0x03,0x22,0x14,0x08}; // >
+const unsigned char PROGMEM chr_063[] = {0x05,0x20,0x40,0x45,0x48,0x30}; // ?
+const unsigned char PROGMEM chr_064[] = {0x07,0x3E,0x41,0x49,0x55,0x5D,0x45,0x38}; // @
+const unsigned char PROGMEM chr_065[] = {0x05,0x3F,0x48,0x48,0x48,0x3F}; // A
+const unsigned char PROGMEM chr_066[] = {0x05,0x7F,0x49,0x49,0x49,0x36}; // B
+const unsigned char PROGMEM chr_067[] = {0x05,0x3E,0x41,0x41,0x41,0x22}; // C
+const unsigned char PROGMEM chr_068[] = {0x05,0x7F,0x41,0x41,0x41,0x3E}; // D
+const unsigned char PROGMEM chr_069[] = {0x05,0x7F,0x49,0x49,0x41,0x41}; // E
+const unsigned char PROGMEM chr_070[] = {0x05,0x7F,0x48,0x48,0x40,0x40}; // F
+const unsigned char PROGMEM chr_071[] = {0x05,0x3E,0x41,0x41,0x49,0x2F}; // G
+const unsigned char PROGMEM chr_072[] = {0x05,0x7F,0x08,0x08,0x08,0x7F}; // H
+const unsigned char PROGMEM chr_073[] = {0x01,0x7F}; // I
+const unsigned char PROGMEM chr_074[] = {0x05,0x02,0x01,0x01,0x01,0x7E}; // J
+const unsigned char PROGMEM chr_075[] = {0x05,0x7F,0x08,0x14,0x22,0x41}; // K
+const unsigned char PROGMEM chr_076[] = {0x05,0x7F,0x01,0x01,0x01,0x01}; // L
+const unsigned char PROGMEM chr_077[] = {0x07,0x7F,0x10,0x08,0x04,0x08,0x10,0x7F}; // M
+const unsigned char PROGMEM chr_078[] = {0x05,0x7F,0x10,0x08,0x04,0x7F}; // N
+const unsigned char PROGMEM chr_079[] = {0x05,0x3E,0x41,0x41,0x41,0x3E}; // O
+const unsigned char PROGMEM chr_080[] = {0x05,0x7F,0x48,0x48,0x48,0x30}; // P
+const unsigned char PROGMEM chr_081[] = {0x05,0x3E,0x41,0x45,0x42,0x3D}; // Q
+const unsigned char PROGMEM chr_082[] = {0x05,0x7F,0x44,0x44,0x46,0x39}; // R
+const unsigned char PROGMEM chr_083[] = {0x05,0x32,0x49,0x49,0x49,0x26}; // S
+const unsigned char PROGMEM chr_084[] = {0x05,0x40,0x40,0x7F,0x40,0x40}; // T
+const unsigned char PROGMEM chr_085[] = {0x05,0x7E,0x01,0x01,0x01,0x7E}; // U
+const unsigned char PROGMEM chr_086[] = {0x05,0x7C,0x02,0x01,0x02,0x7C}; // V
+const unsigned char PROGMEM chr_087[] = {0x07,0x7E,0x01,0x01,0x1E,0x01,0x01,0x7E}; // W
+const unsigned char PROGMEM chr_088[] = {0x05,0x63,0x14,0x08,0x14,0x63}; // X
+const unsigned char PROGMEM chr_089[] = {0x05,0x60,0x10,0x0F,0x10,0x60}; // Y
+const unsigned char PROGMEM chr_090[] = {0x05,0x43,0x45,0x49,0x51,0x61}; // Z
+const unsigned char PROGMEM chr_091[] = {0x03,0x7F,0x41,0x41}; // [
+const unsigned char PROGMEM chr_092[] = {0x03,0x60,0x1C,0x03}; // backslash
+const unsigned char PROGMEM chr_093[] = {0x03,0x41,0x41,0x7F}; // ]
+const unsigned char PROGMEM chr_094[] = {0x05,0x10,0x20,0x40,0x20,0x10}; // ^
+const unsigned char PROGMEM chr_095[] = {0x05,0x01,0x01,0x01,0x01,0x01}; // _
+const unsigned char PROGMEM chr_096[] = {0x02,0x40,0x20}; // `
+const unsigned char PROGMEM chr_097[] = {0x05,0x02,0x15,0x15,0x15,0x0F}; // a
+const unsigned char PROGMEM chr_098[] = {0x05,0x7F,0x11,0x11,0x11,0x0E}; // b
+const unsigned char PROGMEM chr_099[] = {0x05,0x0E,0x11,0x11,0x11,0x0A}; // c
+const unsigned char PROGMEM chr_100[] = {0x05,0x0E,0x11,0x11,0x11,0x7F}; // d
+const unsigned char PROGMEM chr_101[] = {0x05,0x0E,0x15,0x15,0x15,0x0C}; // e
+const unsigned char PROGMEM chr_102[] = {0x05,0x10,0x3F,0x50,0x50,0x40}; // f
+const unsigned char PROGMEM chr_103[] = {0x05,0x08,0x15,0x15,0x15,0x1E}; // g
+const unsigned char PROGMEM chr_104[] = {0x05,0x7F,0x10,0x10,0x10,0x0F}; // h
+const unsigned char PROGMEM chr_105[] = {0x01,0x5F}; // i
+const unsigned char PROGMEM chr_106[] = {0x05,0x02,0x01,0x01,0x01,0x5E}; // j
+const unsigned char PROGMEM chr_107[] = {0x05,0x7F,0x04,0x0C,0x12,0x01}; // k
+const unsigned char PROGMEM chr_108[] = {0x01,0x7F}; // l
+const unsigned char PROGMEM chr_109[] = {0x07,0x1F,0x10,0x10,0x0C,0x10,0x10,0x0F}; // m
+const unsigned char PROGMEM chr_110[] = {0x05,0x1F,0x10,0x10,0x10,0x0F}; // n
+const unsigned char PROGMEM chr_111[] = {0x05,0x0E,0x11,0x11,0x11,0x0E}; // o
+const unsigned char PROGMEM chr_112[] = {0x05,0x0F,0x14,0x14,0x14,0x08}; // p
+const unsigned char PROGMEM chr_113[] = {0x05,0x08,0x14,0x14,0x14,0x0F}; // q
+const unsigned char PROGMEM chr_114[] = {0x05,0x1F,0x04,0x08,0x10,0x10}; // r
+const unsigned char PROGMEM chr_115[] = {0x05,0x09,0x15,0x15,0x15,0x02}; // s
+const unsigned char PROGMEM chr_116[] = {0x05,0x10,0x3E,0x11,0x11,0x01}; // t
+const unsigned char PROGMEM chr_117[] = {0x05,0x1E,0x01,0x01,0x01,0x1E}; // u
+const unsigned char PROGMEM chr_118[] = {0x05,0x1C,0x02,0x01,0x02,0x1C}; // v
+const unsigned char PROGMEM chr_119[] = {0x07,0x1E,0x01,0x01,0x02,0x01,0x01,0x1E}; // w
+const unsigned char PROGMEM chr_120[] = {0x05,0x11,0x0A,0x04,0x0A,0x11}; // x
+const unsigned char PROGMEM chr_121[] = {0x05,0x19,0x05,0x05,0x05,0x1E}; // y
+const unsigned char PROGMEM chr_122[] = {0x05,0x11,0x13,0x15,0x19,0x11}; // z
+const unsigned char PROGMEM chr_123[] = {0x04,0x08,0x36,0x41,0x41}; // {
+const unsigned char PROGMEM chr_124[] = {0x01,0x7F}; // |
+const unsigned char PROGMEM chr_125[] = {0x04,0x41,0x41,0x36,0x08}; // }
+const unsigned char PROGMEM chr_126[] = {0x06,0x20,0x40,0x40,0x20,0x20,0x40}; // ~
+
+const glyph_t font[] PROGMEM = {
+	chr_002, // special character for uncorrectable byte errors
+	chr_001,
+	chr_002,
+	chr_003,
+	chr_032,
+	chr_032,
+	chr_032,
+	chr_032,
+	chr_032,
+	chr_032,
+	chr_032,
+	chr_032,
+	chr_032,
+	chr_032,
+	chr_032,
+	chr_032,
+	chr_032,
+	chr_032,
+	chr_032,
+	chr_032,
+	chr_032,
+	chr_032,
+	chr_032,
+	chr_032,
+	chr_032,
+	chr_032,
+	chr_032,
+	chr_032,
+	chr_032,
+	chr_032,
+	chr_032,
+	chr_032,
+	chr_032,
+	chr_033,
+	chr_034,
+	chr_035,
+	chr_036,
+	chr_037,
+	chr_038,
+	chr_039,
+	chr_040,
+	chr_041,
+	chr_042,
+	chr_043,
+	chr_044,
+	chr_045,
+	chr_046,
+	chr_047,
+	chr_048,
+	chr_049,
+	chr_050,
+	chr_051,
+	chr_052,
+	chr_053,
+	chr_054,
+	chr_055,
+	chr_056,
+	chr_057,
+	chr_058,
+	chr_059,
+	chr_060,
+	chr_061,
+	chr_062,
+	chr_063,
+	chr_064,
+	chr_065,
+	chr_066,
+	chr_067,
+	chr_068,
+	chr_069,
+	chr_070,
+	chr_071,
+	chr_072,
+	chr_073,
+	chr_074,
+	chr_075,
+	chr_076,
+	chr_077,
+	chr_078,
+	chr_079,
+	chr_080,
+	chr_081,
+	chr_082,
+	chr_083,
+	chr_084,
+	chr_085,
+	chr_086,
+	chr_087,
+	chr_088,
+	chr_089,
+	chr_090,
+	chr_091,
+	chr_092,
+	chr_093,
+	chr_094,
+	chr_095,
+	chr_096,
+	chr_097,
+	chr_098,
+	chr_099,
+	chr_100,
+	chr_101,
+	chr_102,
+	chr_103,
+	chr_104,
+	chr_105,
+	chr_106,
+	chr_107,
+	chr_108,
+	chr_109,
+	chr_110,
+	chr_111,
+	chr_112,
+	chr_113,
+	chr_114,
+	chr_115,
+	chr_116,
+	chr_117,
+	chr_118,
+	chr_119,
+	chr_120,
+	chr_121,
+	chr_122,
+	chr_123,
+	chr_124,
+	chr_125,
+	chr_126
+};
+
+
+
+#endif /* FONT_H_ */
diff --git a/src/gpio.cc b/src/gpio.cc
new file mode 100644
index 0000000..23fc6dc
--- /dev/null
+++ b/src/gpio.cc
@@ -0,0 +1,102 @@
+/*
+ * Copyright (C) 2016 by Daniel Friesel
+ *
+ * License: You may use, redistribute and/or modify this file under the terms
+ * of either:
+ * * The GNU LGPL v3 (see COPYING and COPYING.LESSER), or
+ * * The 3-clause BSD License (see COPYING.BSD)
+ *
+ */
+
+#include <avr/io.h>
+#include <stdlib.h>
+
+#include "gpio.h"
+
+GPIO gpio;
+
+void GPIO::pinMode(const uint8_t pin, uint8_t mode)
+{
+	/*
+	 * pin is const, so this switch statement is optimized out by the
+	 * compiler. If mode is also a literal, the function call will also
+	 * be optimized out, resulting in just 2 Bytes per pinMode call.
+	 */
+	switch (pin) {
+		case 1:
+			if (mode == 1)
+				DDRC |= _BV(PC0);
+			else
+				DDRC &= ~_BV(PC0);
+		break;
+		case 2:
+			if (mode == 1)
+				DDRC |= _BV(PC1);
+			else
+				DDRC &= ~_BV(PC1);
+		break;
+		case 3:
+			if (mode == 1)
+				DDRC |= _BV(PC2);
+			else
+				DDRC &= ~_BV(PC2);
+		break;
+		case 4:
+			if (mode == 1)
+				DDRA |= _BV(PA1);
+			else
+				DDRA &= ~_BV(PA1);
+		break;
+	}
+}
+
+void GPIO::digitalWrite(const uint8_t pin, uint8_t value)
+{
+	/*
+	 * will be optimized out -- see above
+	 */
+	switch (pin) {
+		case 1:
+			if (value == 1)
+				PORTC |= _BV(PC0);
+			else
+				PORTC &= ~_BV(PC0);
+		break;
+		case 2:
+			if (value == 1)
+				PORTC |= _BV(PC1);
+			else
+				PORTC &= ~_BV(PC1);
+		break;
+		case 3:
+			if (value == 1)
+				PORTC |= _BV(PC2);
+			else
+				PORTC &= ~_BV(PC2);
+		break;
+		case 4:
+			if (value == 1)
+				PORTA |= _BV(PA1);
+			else
+				PORTA &= ~_BV(PA1);
+		break;
+	}
+}
+
+uint8_t GPIO::digitalRead(const uint8_t pin)
+{
+	/*
+	 * will be optimized out -- see above
+	 */
+	switch (pin) {
+		case 1:
+			return (PINC & _BV(PC0));
+		case 2:
+			return (PINC & _BV(PC1));
+		case 3:
+			return (PINC & _BV(PC2));
+		case 4:
+			return (PINA & _BV(PA1));
+	}
+	return 0;
+}
diff --git a/src/gpio.h b/src/gpio.h
new file mode 100644
index 0000000..addc6e8
--- /dev/null
+++ b/src/gpio.h
@@ -0,0 +1,28 @@
+/*
+ * Copyright (C) 2016 by Daniel Friesel
+ *
+ * License: You may use, redistribute and/or modify this file under the terms
+ * of either:
+ * * The GNU LGPL v3 (see COPYING and COPYING.LESSER), or
+ * * The 3-clause BSD License (see COPYING.BSD)
+ *
+ */
+
+#include <avr/io.h>
+#include <stdlib.h>
+
+/**
+ * GPIO class for the GPIO pins E1 ... E4
+ *
+ * For now, we only support very simple Arduino-like digital pin operations.
+ */
+class GPIO {
+	public:
+		GPIO() {};
+
+		void pinMode(const uint8_t pin, uint8_t mode);
+		void digitalWrite(const uint8_t pin, uint8_t value);
+		uint8_t digitalRead(const uint8_t pin);
+};
+
+extern GPIO gpio;
diff --git a/src/hamming.h b/src/hamming.h
new file mode 100644
index 0000000..275185b
--- /dev/null
+++ b/src/hamming.h
@@ -0,0 +1,47 @@
+/*
+ * Copyright (C) 2016 by Daniel Friesel
+ *
+ * License: You may use, redistribute and/or modify this file under the terms
+ * of either:
+ * * The GNU LGPL v3 (see COPYING and COPYING.LESSER), or
+ * * The 3-clause BSD License (see COPYING.BSD)
+ *
+ */
+
+#ifndef HAMMING_H_
+#define HAMMING_H_
+
+#include <avr/pgmspace.h>
+
+enum HammingResult : uint8_t {
+	NO_ERROR = 0,
+	ERROR_IN_PARITY = 0xfe,
+	UNCORRECTABLE = 0xff,
+};
+
+const uint8_t hammingParityLow[] PROGMEM =
+{ 0,  3,  5,  6,  6,  5,  3,  0,  7,  4,  2,  1,  1,  2,  4,  7 };
+
+const uint8_t hammingParityHigh[] PROGMEM =
+{ 0,  9, 10,  3, 11,  2,  1,  8, 12,  5,  6, 15,  7, 14, 13,  4 };
+
+const uint8_t PROGMEM hammingParityCheck[] = {
+	NO_ERROR,
+	ERROR_IN_PARITY,
+	ERROR_IN_PARITY,
+	0x01,
+	ERROR_IN_PARITY,
+	0x02,
+	0x04,
+	0x08,
+	ERROR_IN_PARITY,
+	0x10,
+	0x20,
+	0x40,
+	0x80,
+	UNCORRECTABLE,
+	UNCORRECTABLE,
+	UNCORRECTABLE
+};
+
+#endif /* HAMMING_H_ */
diff --git a/src/main.cc b/src/main.cc
new file mode 100644
index 0000000..9e37b59
--- /dev/null
+++ b/src/main.cc
@@ -0,0 +1,34 @@
+/*
+ * Copyright (C) 2016 by Daniel Friesel
+ *
+ * License: You may use, redistribute and/or modify this file under the terms
+ * of either:
+ * * The GNU LGPL v3 (see COPYING and COPYING.LESSER), or
+ * * The 3-clause BSD License (see COPYING.BSD)
+ *
+ */
+
+#include <avr/io.h>
+#include <stdlib.h>
+
+#include "system.h"
+
+int main (void)
+{
+	rocket.initialize();
+
+	while (1) {
+		// nothing to do here, go to idle to save power
+		SMCR = _BV(SE);
+		asm("sleep");
+		/*
+		 * The display timer causes a wakeup after 256µs. Run the system
+		 * loop after the timer's ISR is done.
+		 * The Modem also causes wakeups, which is pretty convenient since
+		 * it means we can immediately process the received data.
+		 */
+		rocket.loop();
+	}
+
+	return 0;
+}
diff --git a/src/modem.cc b/src/modem.cc
new file mode 100644
index 0000000..e34910a
--- /dev/null
+++ b/src/modem.cc
@@ -0,0 +1,117 @@
+/* Name: modem.c
+ *
+ * Audio modem for Attiny85 & other AVR chips with modifications
+ *
+ * Author: Jari Tulilahti
+ * Copyright: 2014 Rakettitiede Oy and 2016 Daniel Friesel
+ * License: LGPLv3, see COPYING, and COPYING.LESSER -files for more info
+ */
+
+#include <avr/io.h>
+#include <stdlib.h>
+#include "modem.h"
+#include "fecmodem.h"
+
+extern FECModem modem;
+
+bool Modem::newTransmission()
+{
+	if (new_transmission) {
+		new_transmission = false;
+		return true;
+	}
+	return false;
+}
+
+/*
+ * Returns number of available bytes in ringbuffer or 0 if empty
+ */
+uint8_t Modem::buffer_available() {
+	return buffer_head - buffer_tail;
+}
+
+/*
+ * Store 1 byte in ringbuffer
+ */
+inline void Modem::buffer_put(const uint8_t c) {
+	if (buffer_available() != MODEM_BUFFER_SIZE) {
+		buffer[buffer_head++ % MODEM_BUFFER_SIZE] = c;
+	}
+}
+
+/*
+ * Fetch 1 byte from ringbuffer
+ */
+uint8_t Modem::buffer_get() {
+	uint8_t b = 0;
+	if (buffer_available() != 0) {
+		b = buffer[buffer_tail++ % MODEM_BUFFER_SIZE];
+	}
+	return b;
+}
+
+/*
+ * Start the modem by enabling Pin Change Interrupts & Timer
+ */
+void Modem::enable()  {
+	/* Enable R1 */
+	DDRA  |= _BV(PA3);
+	PORTA |= _BV(PA3);
+
+	/* Modem pin as input */
+	MODEM_DDR &= ~_BV(MODEM_PIN);
+
+	/* Enable Pin Change Interrupts and PCINT for MODEM_PIN */
+	MODEM_PCMSK |= _BV(MODEM_PCINT);
+	PCICR |= _BV(MODEM_PCIE);
+
+	/* Timer: TCCR1: CS10 and CS11 bits: 8MHz clock with Prescaler 64 = 125kHz timer clock */
+	TCCR1B = _BV(CS11) | _BV(CS10);
+}
+
+void Modem::disable()
+{
+	PORTA &= ~_BV(PA3);
+	DDRA  &= ~_BV(PA3);
+}
+
+void Modem::receive() {
+	/* Static variables instead of globals to keep scope inside ISR */
+	static uint8_t modem_bit = 0;
+	static uint8_t modem_bitlen = 0;
+	static uint8_t modem_byte = 0;
+
+	/* Read & Zero Timer/Counter 1 value */
+	uint8_t modem_pulselen = MODEM_TIMER;
+	MODEM_TIMER = 0;
+
+	/*
+	 * Check if we received Start/Sync -pulse.
+	 * Calculate bit signal length middle point from pulse.
+	 * Return from ISR immediately.
+	 */
+	if (modem_pulselen > MODEM_SYNC_LEN) {
+		modem_bitlen = (modem_pulselen >> 2);
+		modem_bit = 0;
+		new_transmission = true;
+		return;
+	}
+
+	/*
+	 * Shift byte and set high bit according to the pulse length.
+	 * Long pulse = 1, Short pulse = 0
+	 */
+	modem_byte = (modem_byte >> 1) | (modem_pulselen < modem_bitlen ? 0x00 : 0x80);
+
+	/* Check if we received complete byte and store it in ring buffer */
+	if (!(++modem_bit % 0x08)) {
+		buffer_put(modem_byte);
+	}
+}
+
+/*
+ * Pin Change Interrupt Vector. This is The Modem.
+ */
+ISR(PCINT3_vect) {
+	modem.receive();
+}
diff --git a/src/modem.h b/src/modem.h
new file mode 100644
index 0000000..7409214
--- /dev/null
+++ b/src/modem.h
@@ -0,0 +1,82 @@
+/* Name: modem.h
+ * Author: Jari Tulilahti
+ * Copyright: 2014 Rakettitiede Oy and 2016 Daniel Friesel
+ * License: LGPLv3, see COPYING, and COPYING.LESSER -files for more info
+ */
+
+#ifndef MODEM_H_
+#define MODEM_H_
+
+#include <avr/interrupt.h>
+#include <stdlib.h>
+
+/* Modem ring buffer size must be power of 2 */
+#define MODEM_BUFFER_SIZE	64
+
+/* Modem defines */
+#define MODEM_SYNC_LEN		42
+#define MODEM_TIMER		TCNT1L
+#define MODEM_PCINT		PCINT24
+#define MODEM_PCMSK		PCMSK3
+#define MODEM_PCIE		PCIE3
+#define MODEM_PIN		PA0
+#define MODEM_DDR		DDRA
+
+/**
+ * Receive-only modem. Sets up a pin change interrupt on the modem pin
+ * and receives bytes using a simple protocol. Does not detect or correct
+ * transmission errors.
+ */
+class Modem {
+	private:
+		uint8_t buffer_head;
+		uint8_t buffer_tail;
+		uint8_t buffer[MODEM_BUFFER_SIZE];
+		bool new_transmission;
+		void buffer_put(const uint8_t c);
+	public:
+		Modem() {new_transmission = false;};
+
+		/**
+		 * Checks if a new transmission was started since the last call
+		 * to this function. Returns true if that is the case and false
+		 * otherwise.
+		 * @return true if a new transmission was started
+		 */
+		bool newTransmission();
+
+		/**
+		 * Checks if there are unprocessed bytes in the modem receive buffer.
+		 * @return number of unprocessed bytes
+		 */
+		uint8_t buffer_available(void);
+
+		/**
+		 * Get next byte from modem receive buffer.
+		 * @return next unprocessed byte (0 if the buffer is empty)
+		 */
+		uint8_t buffer_get(void);
+
+		/**
+		 * Enable the modem. Turns on the input voltage divider on MODEM_PIN
+		 * and enables the receive interrupt (MODEM_PCINT).
+		 */
+		void enable(void);
+
+		/**
+		 * Disable the modem. Disables the receive interrupt and turns off
+		 * the input voltage divider on MODEM_PIN.
+		 */
+		void disable(void);
+
+		/**
+		 * Called by the pin change interrupt service routine whenever the
+		 * modem pin is toggled. Detects sync pulses, receives bits and
+		 * stores complete bytes in the buffer.
+		 *
+		 * Do not call this function yourself.
+		 */
+		void receive(void);
+};
+
+#endif /* MODEM_H_ */
diff --git a/src/static_patterns.h b/src/static_patterns.h
new file mode 100644
index 0000000..94cf51e
--- /dev/null
+++ b/src/static_patterns.h
@@ -0,0 +1,75 @@
+/*
+ * Copyright (C) 2016 by Daniel Friesel
+ *
+ * License: You may use, redistribute and/or modify this file under the terms
+ * of either:
+ * * The GNU LGPL v3 (see COPYING and COPYING.LESSER), or
+ * * The 3-clause BSD License (see COPYING.BSD)
+ *
+ */
+
+#ifndef STATIC_PATTERNS_H_
+#define STATIC_PATTERNS_H_
+
+#include <avr/pgmspace.h>
+
+/*
+ * Note: Static patterns must not be longer than 128 bytes (headers excluded).
+ * See MessageSpecification.md for the meaning of their headers.
+ */
+
+const uint8_t PROGMEM shutdownPattern[] = {
+	0x20, 0x40,
+	0x0e, 0x0f,
+	0xff, 0x81, 0x81, 0x81, 0x81, 0x81, 0x81, 0xff,
+	0x7e, 0x42, 0x42, 0x42, 0x42, 0x42, 0x42, 0x7e,
+	0x3c, 0x24, 0x24, 0x24, 0x24, 0x24, 0x24, 0x3c,
+	0x18, 0x18, 0x18, 0x18, 0x18, 0x18, 0x18, 0x18,
+	0x00, 0x18, 0x18, 0x18, 0x18, 0x18, 0x18, 0x00,
+	0x00, 0x00, 0x18, 0x18, 0x18, 0x18, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x18, 0x18, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+
+const uint8_t PROGMEM flashingPattern[] = {
+	0x20, 0x10,
+	0x08, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x07, 0x33, 0x55, 0x98, 0x00, 0x00
+};
+
+#ifdef LANG_DE
+const uint8_t PROGMEM emptyPattern[] = {
+	0x10, 0x29,
+	0xc0, 0x00,
+	' ',   1, ' ', 'B', 'l', 'i', 'n', 'k', 'e', 'n', 'r', 'o', 'c', 'k', 'e',
+	't', ' ', 'v', '1', '.', '0', ' ', '-', ' ', 'S', 'p', 'e', 'i', 'c', 'h',
+	'e', 'r', ' ', 'i', 's', 't', ' ', 'l', 'e', 'e', 'r'
+};
+#else
+const uint8_t PROGMEM emptyPattern[] = {
+	0x10, 0x28,
+	0xc0, 0x00,
+	' ',   1, ' ', 'B', 'l', 'i', 'n', 'k', 'e', 'n', 'r', 'o', 'c', 'k', 'e',
+	't', ' ', 'v', '1', '.', '0', ' ', '-', ' ', 'S', 't', 'o', 'r', 'a', 'g',
+	'e', ' ', 'i', 's', ' ', 'e', 'm', 'p', 't', 'y'
+};
+#endif
+
+#ifdef LANG_DE
+const uint8_t PROGMEM timeoutPattern[] = {
+	0x10, 0x16,
+	0xc0, 0x00,
+	' ',   2, ' ', 'U', 'e', 'b', 'e', 'r', 't', 'r', 'a', 'g', 'u', 'n', 'g',
+	's', 'f', 'e', 'h', 'l', 'e', 'r'
+};
+#else
+const uint8_t PROGMEM timeoutPattern[] = {
+	0x10, 0x15,
+	0xc0, 0x00,
+	' ',   2, ' ', 'T', 'r', 'a', 'n', 's', 'm', 'i', 's', 's', 'i', 'o', 'n',
+	' ', 'e', 'r', 'r', 'o', 'r'
+};
+#endif
+
+#endif /* STATIC_PATTERNS_H_ */
diff --git a/src/storage.cc b/src/storage.cc
new file mode 100644
index 0000000..05a1d44
--- /dev/null
+++ b/src/storage.cc
@@ -0,0 +1,322 @@
+/*
+ * Copyright (C) 2016 by Daniel Friesel
+ *
+ * License: You may use, redistribute and/or modify this file under the terms
+ * of either:
+ * * The GNU LGPL v3 (see COPYING and COPYING.LESSER), or
+ * * The 3-clause BSD License (see COPYING.BSD)
+ *
+ */
+
+#include <util/delay.h>
+#include <avr/io.h>
+#include <stdlib.h>
+
+#include "storage.h"
+
+Storage storage;
+
+/*
+ * EEPROM data structure ("file system"):
+ *
+ * Organized as 32B-pages, all animations/texts are page-aligned.  Byte 0 ..
+ * 255 : storage metadata. Byte 0 contains the number of animations, byte 1 the
+ * page offset of the first animation, byte 2 of the second, and so on.
+ * Byte 256+: texts/animations without additional storage metadata, aligned
+ * to 32B. So, a maximum of 256-(256/32) = 248 texts/animations can be stored,
+ * and a maximum of 255 * 32 = 8160 Bytes (almost 8 kB / 64 kbit) can be
+ * addressed.  To support larger EEPROMS, change the metadate area to Byte 2 ..
+ * 511 and use 16bit page pointers.
+ *
+ * The text/animation size is not limited by this approach.
+ *
+ * Example:
+ * Byte     0 = 3 -> we've got a total of three animations
+ * Byte     1 = 0 -> first text/animation starts at byte 256 + 32*0 = 256
+ * Byte     2 = 4 -> second starts at byte 256 + 32*4 = 384
+ * Byte     3 = 5 -> third starts at 256 + 32*5 * 416
+ * Byte     4 = whatever
+ *            .
+ *            .
+ *            .
+ * Byte 256ff = first text/animation. Has a header encoding its length in bytes.
+ * Byte 384ff = second
+ * Byte 416ff = third
+ *            .
+ *            .
+ *            .
+ */
+
+void Storage::enable()
+{
+	/*
+	 * Set I2C clock frequency to 100kHz.
+	 * freq = F_CPU / (16 + (2 * TWBR * TWPS) )
+	 * let TWPS = "00" = 1
+	 * -> TWBR = (F_CPU / 100000) - 16 / 2
+	 */
+	TWSR = 0; // the lower two bits control TWPS
+	TWBR = ((F_CPU / 100000UL) - 16) / 2;
+
+	i2c_read(0, 0, 1, &num_anims);
+}
+
+
+/*
+ * Send an I2C (re)start condition and the EEPROM address in read mode. Returns
+ * after it has been transmitted successfully.
+ */
+uint8_t Storage::i2c_start_read()
+{
+	TWCR = _BV(TWINT) | _BV(TWSTA) | _BV(TWEN);
+	while (!(TWCR & _BV(TWINT)));
+	if (!(TWSR & 0x18)) // 0x08 == START ok, 0x10 == RESTART ok
+		return I2C_START_ERR;
+
+	// Note: The R byte ("... | 1") causes the TWI momodule to switch to
+	// Master Receive mode
+	TWDR = (I2C_EEPROM_ADDR << 1) | 1;
+	TWCR = _BV(TWINT) | _BV(TWEN);
+	while (!(TWCR & _BV(TWINT)));
+	if (TWSR != 0x40) // 0x40 == SLA+R transmitted, ACK receveid
+		return I2C_ADDR_ERR;
+
+	return I2C_OK;
+}
+
+/*
+ * Send an I2C (re)start condition and the EEPROM address in write mode.
+ * Returns after it has been transmitted successfully.
+ */
+uint8_t Storage::i2c_start_write()
+{
+	TWCR = _BV(TWINT) | _BV(TWSTA) | _BV(TWEN);
+	while (!(TWCR & _BV(TWINT)));
+	if (!(TWSR & 0x18)) // 0x08 == START ok, 0x10 == RESTART ok
+		return I2C_START_ERR;
+
+	TWDR = (I2C_EEPROM_ADDR << 1) | 0;
+	TWCR = _BV(TWINT) | _BV(TWEN);
+	while (!(TWCR & _BV(TWINT)));
+	if (TWSR != 0x18) // 0x18 == SLA+W transmitted, ACK received
+		return I2C_ADDR_ERR;
+
+	return I2C_OK;
+}
+
+/*
+ * Send an I2C stop condition.
+ */
+void Storage::i2c_stop()
+{
+	TWCR = _BV(TWINT) | _BV(TWSTO) | _BV(TWEN);
+}
+
+/*
+ * Sends len bytes to the EEPROM. Note that this method does NOT
+ * send I2C start or stop conditions.
+ */
+uint8_t Storage::i2c_send(uint8_t len, uint8_t *data)
+{
+	uint8_t pos = 0;
+
+	for (pos = 0; pos < len; pos++) {
+		TWDR = data[pos];
+		TWCR = _BV(TWINT) | _BV(TWEN);
+		while (!(TWCR & _BV(TWINT)));
+		if (TWSR != 0x28) // 0x28 == byte transmitted, ACK received
+			return pos;
+	}
+
+	return pos;
+}
+
+/*
+ * Receives len bytes from the EEPROM into data. Note that this method does
+ * NOT send I2C start or stop conditions.
+ */
+uint8_t Storage::i2c_receive(uint8_t len, uint8_t *data)
+{
+	uint8_t pos = 0;
+
+	for (pos = 0; pos < len; pos++) {
+		if (pos == len-1) {
+			// Don't ACK the last byte
+			TWCR = _BV(TWINT) | _BV(TWEN);
+		} else {
+			// Automatically send ACK
+			TWCR = _BV(TWINT) | _BV(TWEN) | _BV(TWEA);
+		}
+		while (!(TWCR & _BV(TWINT)));
+		data[pos] = TWDR;
+		/*
+		 * No error handling here -- We send the acks, the EEPROM only
+		 * supplies raw data, so there's no way of knowing whether it's still
+		 * talking to us or we're just reading garbage.
+		 */
+	}
+
+	return pos;
+}
+
+/*
+ * Writes len bytes of data into the EEPROM, starting at byte number pos.
+ * Does not check for page boundaries.
+ * Includes a complete I2C transaction.
+ */
+uint8_t Storage::i2c_write(uint8_t addrhi, uint8_t addrlo, uint8_t len, uint8_t *data)
+{
+	uint8_t addr_buf[2];
+	uint8_t num_tries;
+
+	addr_buf[0] = addrhi;
+	addr_buf[1] = addrlo;
+
+	/*
+	 * The EEPROM might be busy processing a write command, which can
+	 * take up to 10ms. Wait up to 16ms to respond before giving up.
+	 * All other error conditions (even though they should never happen[tm])
+	 * are handled the same way.
+	 */
+	for (num_tries = 0; num_tries < 32; num_tries++) {
+		if (num_tries > 0)
+			_delay_us(500);
+
+		if (i2c_start_write() != I2C_OK)
+			continue; // EEPROM is busy writing
+
+		if (i2c_send(2, addr_buf) != 2)
+			continue; // should not happen
+
+		if (i2c_send(len, data) != len)
+			continue; // should not happen
+
+		i2c_stop();
+		return I2C_OK;
+	}
+
+	i2c_stop();
+	return I2C_ERR;
+}
+
+/*
+ * Reads len bytes of data from the EEPROM, starting at byte number pos.
+ * Does not check for page boundaries.
+ * Includes a complete I2C transaction.
+ */
+uint8_t Storage::i2c_read(uint8_t addrhi, uint8_t addrlo, uint8_t len, uint8_t *data)
+{
+	uint8_t addr_buf[2];
+	uint8_t num_tries;
+
+	addr_buf[0] = addrhi;
+	addr_buf[1] = addrlo;
+
+	/*
+	 * See comments in i2c_write.
+	 */
+	for (num_tries = 0; num_tries < 32; num_tries++) {
+		if (num_tries > 0)
+			_delay_us(500);
+
+		if (i2c_start_write() != I2C_OK)
+			continue; // EEPROM is busy writing
+
+		if (i2c_send(2, addr_buf) != 2)
+			continue; // should not happen
+
+		if (i2c_start_read() != I2C_OK)
+			continue; // should not happen
+
+		if (i2c_receive(len, data) != len)
+			continue; // should not happen
+
+		i2c_stop();
+		return I2C_OK;
+	}
+
+	i2c_stop();
+	return I2C_ERR;
+}
+
+void Storage::reset()
+{
+	first_free_page = 0;
+	num_anims = 0;
+}
+
+void Storage::sync()
+{
+	i2c_write(0, 0, 1, &num_anims);
+}
+
+bool Storage::hasData()
+{
+	// Unprogrammed EEPROM pages always read 0xff
+	if (num_anims == 0xff)
+		return false;
+	return num_anims;
+}
+
+void Storage::load(uint8_t idx, uint8_t *data)
+{
+	i2c_read(0, 1 + idx, 1, &page_offset);
+
+	/*
+	 * Unconditionally read 132 bytes. The data buffer must hold at least
+	 * 132 bytes anyways, and this way we can save one I2C transaction. If
+	 * there is any speed penalty cause by this I wasn't able to notice it.
+	 * Also note that the EEPROM automatically wraps around when the end of
+	 * memory is reached, so this edge case doesn't need to be accounted for.
+	 */
+	i2c_read(1 + (page_offset / 8), (page_offset % 8) * 32, 132, data);
+}
+
+void Storage::loadChunk(uint8_t chunk, uint8_t *data)
+{
+	uint8_t this_page_offset = page_offset + (4 * chunk);
+
+	// Note that we do not load headers here -> 128 instead of 132 bytes
+	i2c_read(1 + (this_page_offset / 8), (this_page_offset % 8) * 32 + 4, 128, data);
+}
+
+void Storage::save(uint8_t *data)
+{
+	/*
+	 * Technically, we can store up to 255 patterns. However, Allowing
+	 * 255 patterns (-> num_anims = 0xff) means we can't easily
+	 * distinguish between an EEPROM with 255 patterns and a factory-new
+	 * EEPROM (which just reads 0xff everywhere). So only 254 patterns
+	 * are allowed.
+	 */
+	if (num_anims < 254) {
+		/*
+		* Bytes 0 .. 255 (pages 0 .. 7) are reserved for storage metadata,
+		* first_free_page counts pages starting at byte 256 (page 8).
+		* So, first_free_page == 247 addresses EEPROM bytes 8160 .. 8191.
+		* first_free_page == 248 would address bytes 8192 and up, which don't
+		* exist -> don't save anything afterwards.
+		*
+		* Note that at the moment (stored patterns are aligned to page
+		* boundaries) this means we can actually only store up to 248
+		* patterns.
+		*/
+		if (first_free_page < 248) {
+			num_anims++;
+			i2c_write(0, num_anims, 1, &first_free_page);
+			append(data);
+		}
+	}
+}
+
+void Storage::append(uint8_t *data)
+{
+	// see comment in Storage::save()
+	if (first_free_page < 248) {
+		// the header indicates the length of the data, but we really don't care
+		// - it's easier to just write the whole page and skip the trailing
+		// garbage when reading.
+		i2c_write(1 + (first_free_page / 8), (first_free_page % 8) * 32, 32, data);
+		first_free_page++;
+	}
+}
diff --git a/src/storage.h b/src/storage.h
new file mode 100644
index 0000000..6b76190
--- /dev/null
+++ b/src/storage.h
@@ -0,0 +1,199 @@
+/*
+ * Copyright (C) 2016 by Daniel Friesel
+ *
+ * License: You may use, redistribute and/or modify this file under the terms
+ * of either:
+ * * The GNU LGPL v3 (see COPYING and COPYING.LESSER), or
+ * * The 3-clause BSD License (see COPYING.BSD)
+ *
+ */
+
+#include <stdlib.h>
+
+#define I2C_EEPROM_ADDR 0x50
+
+class Storage {
+	private:
+		/**
+		 * Number of animations on the storage, AKA contents of byte 0x0000.
+		 * A value of 0xff indicates that the EEPROM was never written to
+		 * and therefore contains no animations.
+		 */
+		uint8_t num_anims;
+
+		/**
+		 * Page offset of the pattern read by the last load() call. Used to
+		 * calculate the read address in loadChunk(). The animation this
+		 * offset refers to starts at byte 256 + (32 * page_offset).
+		 */
+		uint8_t page_offset;
+
+		/**
+		 * First free page (excluding the 256 byte metadata area) on the
+		 * EEPROM. Used by save() and append(). This value refers to the
+		 * EEPROM bytes 256 + (32 * first_free_page) and up.
+		 */
+		uint8_t first_free_page;
+
+		enum I2CStatus : uint8_t {
+			I2C_OK,
+			I2C_START_ERR,
+			I2C_ADDR_ERR,
+			I2C_ERR
+		};
+
+		/**
+		 * Sends an I2C start condition and the I2C_EEPROM_ADDR with the
+		 * write flag set.
+		 *
+		 * @return An I2CStatus value indicating success/failure
+		 */
+		uint8_t i2c_start_write(void);
+
+		/**
+		 * Sends an I2C start condition and the I2C_EEPROM_ADDR with the
+		 * read flag set.
+		 *
+		 * @return An I2CStatus value indicating success/failure
+		 */
+		uint8_t i2c_start_read(void);
+
+		/**
+		 * Sends an I2C stop condition. Does not check for errors.
+		 */
+		void i2c_stop(void);
+
+		/**
+		 * Sends up to len bytes of data via I2C. i2c_start_write() must
+		 * have been called successfully for this to work.
+		 *
+		 * @param len number of bytes to send
+		 * @param data pointer to data buffer, must be at least len bytes
+		 * @return number of bytes which were successfully sent (0 .. len)
+		 */
+		uint8_t i2c_send(uint8_t len, uint8_t *data);
+
+		/**
+		 * Receives up to len bytes of data via I2C. i2c_start_read() must
+		 * have been called successfully for this to work.
+		 *
+		 * @param len number of bytes to receive
+		 * @param data pointer to data buffer, must be at least len bytes
+		 * @return number of bytes which were successfully received (0 .. len)
+		 */
+		uint8_t i2c_receive(uint8_t len, uint8_t *data);
+
+		/**
+		 * Reads len bytes of data stored on addrhi, addrlo from the EEPROM
+		 * into the data buffer. Does a complete I2C transaction including
+		 * start and stop conditions. addrlo may start at an arbitrary
+		 * position, page boundaries are irrelevant for this function. If a
+		 * read reaches the end of the EEPROM memory, it will wrap around to
+		 * byte 0x0000.
+		 *
+		 * @param addrhi upper address byte. Must be less than 32
+		 * @param addrlo lower address byte
+		 * @param len number of bytes to read
+		 * @param data pointer to data buffer, must be at least len bytes
+		 * @return An I2CStatus value indicating success/failure
+		 */
+		uint8_t i2c_read(uint8_t addrhi, uint8_t addrlo, uint8_t len, uint8_t *data);
+
+		/**
+		 * Writes len bytes of data from the data buffer into addrhi, addrlo
+		 * on the EEPROM. Does a complete I2C transaction including start and
+		 * stop conditions. Note that the EEPROM consists of 32 byte pages,
+		 * so it is not possible to write more than 32 bytes in one
+		 * operation.  Also note that this function does not check for page
+		 * boundaries.  Starting a 32-byte write in the middle of a page will
+		 * put the first 16 bytes where they belong, while the second 16
+		 * bytes will wrap around to the first 16 bytes of the page.
+		 *
+		 * @param addrhi upper address byte. Must be less than 32
+		 * @param addrlo lower address byte
+		 * @param len number of bytes to write
+		 * @param data pointer to data buffer, must be at least len bytes
+		 * @return An I2CStatus value indicating success/failure
+		 */
+		uint8_t i2c_write(uint8_t addrhi, uint8_t addrlo, uint8_t len, uint8_t *data);
+
+	public:
+		Storage() { num_anims = 0; first_free_page = 0;};
+
+		/**
+		 * Enables the storage hardware: Configures the internal I2C
+		 * module and reads num_anims from the EEPROM.
+		 */
+		void enable();
+
+		/**
+		 * Prepares the storage for a complete overwrite by setting the
+		 * number of stored animations to zero. The next save operation
+		 * will get pattern id 0 and overwrite the first stored pattern.
+		 *
+		 * Note that this function does not write anything to the
+		 * EEPROM. Use Storage::sync() for that.
+		 */
+		void reset();
+
+		/**
+		 * Writes the current number of animations (as set by reset() or
+		 * save() to the EEPROM. Required to get a consistent storage state
+		 * after a power cycle.
+		 */
+		void sync();
+
+		/**
+		 * Checks whether the EEPROM contains animathion data.
+		 *
+		 * @return true if the EEPROM contains valid-looking data
+		 */
+		bool hasData();
+
+		/**
+		 * Accessor for the number of saved patterns on the EEPROM.
+		 * A return value of 255 (0xff) means that there are no patterns
+		 * on the EEPROM (and hasData() returns false in that case).
+		 *
+		 * @return number of patterns
+		 */
+		uint8_t numPatterns() { return num_anims; };
+
+		/**
+		 * Loads pattern number idx from the EEPROM. The 
+		 *
+		 * @param idx pattern index (starting with 0)
+		 * @param pointer to the data structure for the pattern. Must be
+		 *        at least 132 bytes
+		 */
+		void load(uint8_t idx, uint8_t *data);
+
+		/**
+		 * Load partial pattern chunk (without header) from EEPROM.
+		 *
+		 * @param chunk 128 byte-offset inside pattern (starting with 0)
+		 * @param data pointer to data structure for the pattern. Must be
+		 *        at least 128 bytes
+		 */
+		void loadChunk(uint8_t chunk, uint8_t *data);
+
+		/**
+		 * Save (possibly partial) pattern on the EEPROM. 32 bytes of
+		 * dattern data will be read and stored, regardless of the
+		 * pattern header.
+		 *
+		 * @param data pattern data. Must be at least 32 bytes
+		 */
+		void save(uint8_t *data);
+
+		/**
+		 * Continue saving a pattern on the EEPROM. Appends 32 bytes of
+		 * pattern data after the most recently written block of data
+		 * (i.e., to the pattern which is currently being saved).
+		 *
+		 * @param data pattern data. Must be at least 32 bytes
+		 */
+		void append(uint8_t *data);
+};
+
+extern Storage storage;
diff --git a/src/system.cc b/src/system.cc
new file mode 100644
index 0000000..535702b
--- /dev/null
+++ b/src/system.cc
@@ -0,0 +1,367 @@
+/*
+ * Copyright (C) 2016 by Daniel Friesel
+ *
+ * License: You may use, redistribute and/or modify this file under the terms
+ * of either:
+ * * The GNU LGPL v3 (see COPYING and COPYING.LESSER), or
+ * * The 3-clause BSD License (see COPYING.BSD)
+ *
+ */
+
+#include <avr/io.h>
+#include <avr/interrupt.h>
+#include <avr/wdt.h>
+#include <avr/pgmspace.h>
+#include <util/delay.h>
+#include <stdlib.h>
+
+#include "display.h"
+#include "fecmodem.h"
+#include "storage.h"
+#include "system.h"
+#include "static_patterns.h"
+
+#define SHUTDOWN_THRESHOLD 2048
+
+System rocket;
+
+animation_t active_anim;
+
+uint8_t disp_buf[132]; // 4 byte header + 128 byte data
+uint8_t *rx_buf = disp_buf + sizeof(disp_buf) - 33;
+
+void System::initialize()
+{
+	// disable ADC to save power
+	PRR |= _BV(PRADC);
+
+	// dito
+	wdt_disable();
+
+	// Enable pull-ups on PC3 and PC7 (button pins)
+	PORTC |= _BV(PC3) | _BV(PC7);
+
+	display.enable();
+	modem.enable();
+	storage.enable();
+
+	//storage.reset();
+	//storage.save((uint8_t *)"\x10\x0a\x11\x00nootnoot");
+	//storage.save((uint8_t *)"\x10\x09\x20\x00" "fnordor");
+	//storage.save((uint8_t *)"\x10\x05\x20\x00 \x01 ");
+	//storage.save((uint8_t *)"\x20\x22\x08\x02"
+	//		"\x00\x04\x22\x02\x22\x04\x00\x00"
+	//		"\x00\x00\x00\x00\x00\x00\x00\x00"
+	//		"\x00\x04\x22\x02\x22\x04\x00\x00"
+	//		"\x00\x00\x00\x00");
+	//storage.append((uint8_t *)"\x00\x00\x00\x00");
+
+	sei();
+
+	current_anim_no = 0;
+	loadPattern(0);
+}
+
+void System::loadPattern_P(const uint8_t *pattern_ptr)
+{
+	uint8_t i;
+
+	for (i = 0; i < 4; i++)
+		disp_buf[i] = pgm_read_byte(pattern_ptr + i);
+
+	for (i = 0; i < disp_buf[1]; i++)
+		disp_buf[i+4] = pgm_read_byte(pattern_ptr + i + 4);
+
+	loadPattern_buf(disp_buf);
+}
+
+void System::loadPattern_buf(uint8_t *pattern)
+{
+	active_anim.type = (AnimationType)(pattern[0] >> 4);
+	active_anim.length = (pattern[0] & 0x0f) << 8;
+	active_anim.length += pattern[1];
+
+	if (active_anim.type == AnimationType::TEXT) {
+		active_anim.speed = 250 - (pattern[2] & 0xf0);
+		active_anim.delay = (pattern[2] & 0x0f );
+		active_anim.direction = pattern[3] >> 4;
+	} else if (active_anim.type == AnimationType::FRAMES) {
+		active_anim.speed = 250 - ((pattern[2] & 0x0f) << 4);
+		active_anim.delay = (pattern[3] & 0x0f);
+		active_anim.direction = 0;
+	}
+
+	active_anim.data = pattern + 4;
+	display.show(&active_anim);
+}
+
+void System::loadPattern(uint8_t anim_no)
+{
+	if (storage.hasData()) {
+		storage.load(anim_no, disp_buf);
+		loadPattern_buf(disp_buf);
+	} else {
+		loadPattern_P(emptyPattern);
+	}
+}
+
+void System::receive(void)
+{
+	static uint8_t rx_pos = 0;
+	static uint16_t remaining_bytes = 0;
+	uint8_t rx_byte = modem.buffer_get();
+
+	/*
+	 * START* and PATTERN* are sync signals, everything else needs to be
+	 * stored on the EEPROM.
+	 * (Note that the C++ standard guarantees "rxExpect > PATTERN2" to match
+	 * for HEADER*, META* and DATA since they are located after PATTERN2
+	 * in the RxExpect enum declaration)
+	 */
+	if (rxExpect > PATTERN2) {
+		rx_buf[rx_pos++] = rx_byte;
+		/*
+		 * HEADER and META are not included in the length
+		 * -> only count bytes for DATA.
+		 */
+		if (rxExpect > META2) {
+			remaining_bytes--;
+		}
+	}
+
+	switch(rxExpect) {
+		case START1:
+			if (rx_byte == BYTE_START)
+				rxExpect = START2;
+			else
+				rxExpect = NEXT_BLOCK;
+			break;
+		case START2:
+			if (rx_byte == BYTE_START) {
+				rxExpect = PATTERN1;
+				storage.reset();
+				loadPattern_P(flashingPattern);
+				MCUSR &= ~_BV(WDRF);
+				cli();
+				// watchdog interrupt after 4 seconds
+				WDTCSR = _BV(WDCE) | _BV(WDE);
+				WDTCSR = _BV(WDIE) | _BV(WDP3);
+				sei();
+			} else {
+				rxExpect = NEXT_BLOCK;
+			}
+			break;
+		case NEXT_BLOCK:
+			if (rx_byte == BYTE_START)
+				rxExpect = START2;
+			else if (rx_byte == BYTE_PATTERN)
+				rxExpect = PATTERN2;
+			else if (rx_byte == BYTE_END) {
+				storage.sync();
+				current_anim_no = 0;
+				loadPattern(0);
+				rxExpect = START1;
+				wdt_disable();
+			}
+			break;
+		case PATTERN1:
+			if (rx_byte == BYTE_PATTERN)
+				rxExpect = PATTERN2;
+			else
+				rxExpect = NEXT_BLOCK;
+			break;
+		case PATTERN2:
+			rx_pos = 0;
+			if (rx_byte == BYTE_PATTERN)
+				rxExpect = HEADER1;
+			else
+				rxExpect = NEXT_BLOCK;
+			break;
+		case HEADER1:
+			rxExpect = HEADER2;
+			remaining_bytes = (rx_byte & 0x0f) << 8;
+			break;
+		case HEADER2:
+			rxExpect = META1;
+			remaining_bytes += rx_byte;
+			wdt_reset();
+			break;
+		case META1:
+			rxExpect = META2;
+			break;
+		case META2:
+			rxExpect = DATA_FIRSTBLOCK;
+			/*
+			 * skip empty patterns (would bork because of remaining_bytes--
+			 * otherwise
+			 */
+			if (remaining_bytes == 0)
+				rxExpect = NEXT_BLOCK;
+			break;
+		case DATA_FIRSTBLOCK:
+			if (remaining_bytes == 0) {
+				rxExpect = NEXT_BLOCK;
+				storage.save(rx_buf);
+			} else if (rx_pos == 32) {
+				rxExpect = DATA;
+				rx_pos = 0;
+				storage.save(rx_buf);
+			}
+			break;
+		case DATA:
+			if (remaining_bytes == 0) {
+				rxExpect = NEXT_BLOCK;
+				storage.append(rx_buf);
+			} else if (rx_pos == 32) {
+				rx_pos = 0;
+				storage.append(rx_buf);
+				wdt_reset();
+			}
+			break;
+	}
+}
+
+void System::loop()
+{
+	// First, check for a shutdown request (long press on both buttons)
+	if ((PINC & (_BV(PC3) | _BV(PC7))) == 0) {
+		/*
+		 * Naptime!
+		 * (But not before both buttons have been pressed for at least
+		 * SHUTDOWN_THRESHOLD * 0.256 ms)
+		 */
+		if (want_shutdown < SHUTDOWN_THRESHOLD) {
+			want_shutdown++;
+		}
+		else {
+			shutdown();
+			want_shutdown = 0;
+		}
+	}
+	else {
+		want_shutdown = 0;
+	}
+
+	if (btn_debounce == 0) {
+		if ((PINC & _BV(PC3)) == 0) {
+			btnMask = (ButtonMask)(btnMask | BUTTON_RIGHT);
+		}
+		if ((PINC & _BV(PC7)) == 0) {
+			btnMask = (ButtonMask)(btnMask | BUTTON_LEFT);
+		}
+		/*
+		* Only handle button presses when they are released to avoid
+		* double actions, such as switching to the next/previous pattern
+		* when the user actually wants to press the shutdown combo.
+		*/
+		if ((PINC & (_BV(PC3) | _BV(PC7))) == (_BV(PC3) | _BV(PC7))) {
+			if (btnMask == BUTTON_RIGHT) {
+				current_anim_no = (current_anim_no + 1) % storage.numPatterns();
+				loadPattern(current_anim_no);
+			} else if (btnMask == BUTTON_LEFT) {
+				if (current_anim_no == 0)
+					current_anim_no = storage.numPatterns() - 1;
+				else
+					current_anim_no--;
+				loadPattern(current_anim_no);
+			}
+			btnMask = BUTTON_NONE;
+			/*
+			 * Ignore keypresses for 25ms to work around bouncing buttons
+			 */
+			btn_debounce = 100;
+		}
+	} else {
+		btn_debounce--;
+	}
+
+	while (modem.buffer_available()) {
+		receive();
+	}
+
+	display.update();
+}
+
+void System::shutdown()
+{
+	uint8_t i;
+
+	modem.disable();
+
+	// show power down image
+	loadPattern_P(shutdownPattern);
+
+	// wait until both buttons are released
+	while (!((PINC & _BV(PC3)) && (PINC & _BV(PC7))))
+		display.update();
+
+	// and some more to debounce the buttons (and finish powerdown animation)
+	for (i = 0; i < 200; i++) {
+		display.update();
+		_delay_ms(1);
+	}
+
+	// turn off display to indicate we're about to shut down
+	display.disable();
+
+	// actual naptime
+
+	// enable PCINT on PC3 (PCINT11) and PC7 (PCINT15) for wakeup
+	PCMSK1 |= _BV(PCINT15) | _BV(PCINT11);
+	PCICR |= _BV(PCIE1);
+
+	// go to power-down mode
+	SMCR = _BV(SM1) | _BV(SE);
+	asm("sleep");
+
+	// execution will resume here - disable PCINT again.
+	// Don't disable PCICR, something else might need it.
+	PCMSK1 &= ~(_BV(PCINT15) | _BV(PCINT11));
+
+	// turn on display
+	loadPattern(current_anim_no);
+	display.enable();
+
+	/*
+	 * Wait for wakeup button(s) to be released to avoid accidentally
+	 * going back to sleep again or switching the active pattern.
+	 */
+	while (!((PINC & _BV(PC3)) && (PINC & _BV(PC7))))
+		display.update();
+
+	// debounce
+	for (i = 0; i < 100; i++) {
+		display.update();
+		_delay_ms(1);
+	}
+
+	// finally, turn on the modem...
+	modem.enable();
+
+	// ... and reset the receive state machine
+	rxExpect = START1;
+}
+
+void System::handleTimeout()
+{
+	modem.disable();
+	modem.enable();
+	rxExpect = START1;
+	current_anim_no = 0;
+	loadPattern_P(timeoutPattern);
+}
+
+ISR(PCINT1_vect)
+{
+	// we use PCINT1 for wakeup, so we need an (empty) ISR for it
+}
+
+ISR(WDT_vect)
+{
+	/*
+	 * Modem transmission was interrupted without END byte. Reset state
+	 * machine and show timeout message.
+	 */
+	wdt_disable();
+	rocket.handleTimeout();
+}
diff --git a/src/system.h b/src/system.h
new file mode 100644
index 0000000..eb5d9dd
--- /dev/null
+++ b/src/system.h
@@ -0,0 +1,144 @@
+/*
+ * Copyright (C) 2016 by Daniel Friesel
+ *
+ * License: You may use, redistribute and/or modify this file under the terms
+ * of either:
+ * * The GNU LGPL v3 (see COPYING and COPYING.LESSER), or
+ * * The 3-clause BSD License (see COPYING.BSD)
+ *
+ */
+
+#include <stdlib.h>
+
+#define SHUTDOWN_THRESHOLD 2048
+
+/**
+ * Contains the system idle loop. Checks for button presses, handles
+ * standby/resume, reads data from the Modem and updates the Display.
+ */
+class System {
+	private:
+		/**
+		 * Shutdown threshold counter. Contains the time since both
+		 * buttons were first pressed at the same time in 256µs steps.
+		 */
+		uint16_t want_shutdown;
+
+		/**
+		 * Debounce counter for button presses. Buttons are ignored while
+		 * this value is greater than zero
+		 */
+		uint8_t btn_debounce;
+
+		/**
+		 * Index of the currently active animation
+		 */
+		uint8_t current_anim_no;
+
+		/**
+		 * Shuts down the entire system. Shows a shutdown animation, waits
+		 * untel both buttons are released, turns off all hardware and puts
+		 * the system to sleep. Re-enables the hardware and shows the
+		 * last active animation after a wakeup
+		 */
+		void shutdown(void);
+
+		/**
+		 * Modem receive function. Maintains the internal state machine
+		 * (see RxExpect)
+		 */
+		void receive(void);
+
+		/**
+		 * Loads a pattern from the EEPROM and shows it on the display.
+		 * Loads the first 132 bytes (4 bytes header + 128 bytes data) of
+		 * the pattern into the global disp_buf variable, updates the
+		 * global active_anim to reflect the read metadata and calls
+		 * Display::show() to display the pattern.
+		 *
+		 * @param pattern_no index of pattern to show
+		 */
+		void loadPattern(uint8_t pattern_no);
+
+		/**
+		 * Show the pattern stored in pattern on the display.
+		 * Updates the global active_anim object with the metadata
+		 * stored in the first four bytes of pattern and cals
+		 * Display::show() to display it
+		 *
+		 * @param pattern array containing the pattern
+		 */
+		void loadPattern_buf(uint8_t *pattern);
+
+		/**
+		 * Load pattern from PROGMEM. Loads the entire pattern stored
+		 * at pattern_ptr into the global disp_buf variable, updates
+		 * the global active_anim object with the metadata stored in the
+		 * first four pattern bytes and calls Display::show() to display
+		 * the pattern. The pattern data must not be longer than 128 bytes.
+		 *
+		 * @param pattern_ptr pointer to pattern data in PROGMEM
+		 */
+		void loadPattern_P(const uint8_t *pattern_ptr);
+
+		enum TransmissionControl : uint8_t {
+			BYTE_END = 0x84,
+			BYTE_START = 0x99,
+			BYTE_PATTERN = 0xa9,
+		};
+
+		enum ButtonMask : uint8_t {
+			BUTTON_NONE = 0,
+			BUTTON_LEFT = 1,
+			BUTTON_RIGHT = 2,
+			BUTTON_BOTH = 3
+		};
+
+		enum RxExpect : uint8_t {
+			START1,
+			START2,
+			NEXT_BLOCK,
+			PATTERN1,
+			PATTERN2,
+			HEADER1,
+			HEADER2,
+			META1,
+			META2,
+			DATA_FIRSTBLOCK,
+			DATA,
+		};
+
+		RxExpect rxExpect;
+		ButtonMask btnMask;
+
+	public:
+		System() { want_shutdown = 0; rxExpect = START1; current_anim_no = 0; btnMask = BUTTON_NONE; btn_debounce = 0;};
+
+		/**
+		 * Initial MCU setup. Turns off unused peripherals to save power
+		 * and configures the button pins. Also configures all other pins
+		 * and peripherals using the enable function of their respective
+		 * classes. Turns on interrupts once that's done.
+		 */
+		void initialize(void);
+
+		/**
+		 * System idle loop. Checks for button presses, handles
+		 * standby/resume, reads data from the Modem and updates the Display.
+		 *
+		 * It is recommended to run this function before going back to sleep
+		 * whenever the system is woken up by an interrupt.
+		 */
+		void loop(void);
+
+		/**
+		 * Resets the modem receive state machine and loads the
+		 * "Transmission error" message. Called by the Watchdog Timeout
+		 * ISR when a transmission was started (2x START received) but not
+		 * properly finished (that is, four seconds passed since the last
+		 * received byte and END byte was receveid).
+		 */
+		void handleTimeout(void);
+};
+
+extern System rocket;
diff --git a/utilities/blinkenrocket.py b/utilities/blinkenrocket.py
new file mode 100644
index 0000000..d16b7cf
--- /dev/null
+++ b/utilities/blinkenrocket.py
@@ -0,0 +1,315 @@
+#!/usr/bin/env python
+
+import sys, wave
+
+class modem:
+
+	# Modem specific constants
+	bits = [[3 * chr(0), 5 * chr(0)], [3 * chr(255), 5 * chr(255)]]
+	sync = [17 * chr(0), 17 * chr(255)]
+	# Variable to alternate high and low
+	hilo = 0
+	supportedFrequencies = [16000,22050,24000,32000,44100,48000]
+	cnt = 0
+	# Data variables
+	data = []
+	parity = True
+	frequency = 48000
+
+	# Hamming code translation table
+	_hammingCalculateParityLowNibble = [0,  3,  5,  6,  6,  5,  3,  0,  7,  4,  2,  1,  1,  2,  4,  7]
+	_hammingCalculateParityHighNibble = [0,  9, 10,  3, 11,  2,  1,  8, 12,  5,  6, 15,  7, 14, 13,  4]
+
+	# Almost nothing here
+	def __init__(self, data=[], parity=True, frequency=48000):
+		self.data = data
+		self.parity = parity
+		self.frequency = frequency if frequency in self.supportedFrequencies else 48000
+		self.cnt = 0
+
+	# Calculate Hamming parity for 12,8 code (12 bit of which 8bit data)
+	def hammingCalculateParity128(self, byte):
+		return self._hammingCalculateParityLowNibble[byte&0x0F] ^ self._hammingCalculateParityHighNibble[byte >> 4]
+
+	# Calculate Hamming parity for 24,16 code (24 bit of which 16 bit are data)
+	def hammingCalculateParity2416(self, first, second):
+		return self.hammingCalculateParity128(second) << 4 | self.hammingCalculateParity128(first)
+
+	# Generate one sync-pulse
+	def syncsignal(self):
+		self.hilo ^= 1
+		return self.sync[self.hilo]
+
+	# Generate a number of sync signals
+	def generateSyncSignal(self, number):
+		sound = ""
+		for i in xrange(number):
+			sound += self.syncsignal()
+		return sound
+
+	# Decode bits to modem signals
+	def modemcode(self, byte):
+		bleep = ""
+		for x in xrange(8):
+			self.hilo ^= 1
+			bleep += self.bits[self.hilo][byte & 0x01]
+			byte >>= 1
+		return bleep
+
+	# Return <length> samples of silence
+	def silence(self, length):
+		return chr(127) * length
+
+	# Set data for modem code
+	def setData(self, data):
+		self.data = data
+
+	# Set whether to use parity or not
+	def setParity(self, parity):
+		self.parity = parity
+
+	# Set the frequency for the audio
+	def setFrequency(self, frequency):
+		self.frequency = frequency if frequency in self.supportedFrequencies else 48000
+
+	# Generates the audio frames based on the data
+	def generateAudioFrames(self):
+		if self.parity:
+			tmpdata = []
+			# for uneven length data, we have to append a null byte
+			if not len(self.data) % 2 == 0:
+				self.data.append(chr(0))
+			# insert the parity information every two bytes, sorry for the heavy casting
+			for index in range(0, len(self.data), 2):
+				tmpdata.extend(self.data[index:index+2])
+				tmpdata.append(chr(self.hammingCalculateParity2416(ord(self.data[index]),ord(self.data[index+1]))))
+			self.data = tmpdata
+		# generate the audio itself
+		# add 1000ms of sync signal before the data
+		# (some sound cards take a while to produce a proper output signal)
+		sound = self.generateSyncSignal(3000)
+		# process the data and insert sync signal every 10 bytes
+		for byte in self.data:
+			sound += self.modemcode(ord(byte))
+			self.cnt += 1
+			if self.cnt == 9: # ! do not send sync inside (byte1 byte2 parity) triples
+				sound += self.generateSyncSignal(4)
+				self.cnt = 0
+		# add some sync signals in the end
+		sound += self.generateSyncSignal(4)
+		return sound
+
+	def saveAudio(self,filename):
+		wav = wave.open(filename, 'wb')
+		wav.setparams((1, 1, self.frequency, 0, "NONE", None))
+		wav.writeframes(self.generateAudioFrames())
+		wav.close()
+
+class Frame( object ):
+	""" Returns the frame information """
+	def getFrameHeader(self):
+		raise NotImplementedError("You should implement this!")
+
+	""" Returns the representation """
+	def getRepresentation(self):
+		raise NotImplementedError("Should have implemented this")
+
+class textFrame(Frame):
+	text = ""
+	speed = 0
+	delay = 0
+	direction = 0
+	# identifier as of message specification: 0001
+	identifier = 0x01
+
+	def __init__(self,text,speed=13,delay=0,direction=0):
+		self.text = text
+		self.setSpeed(speed)
+		self.setDelay(delay)
+		self.setDirection(direction)
+
+	def setSpeed(self,speed):
+		self.speed = speed if speed < 16 else 1
+
+	def setDelay(self,delay):
+		self.delay = delay if delay < 16 else 0
+
+	def setDirection(self,direction):
+		self.direction = direction if direction in [0,1] else 0
+
+	# Frame header: 4 bit type + 12 bit length
+	def getFrameHeader(self):
+		return [chr(self.identifier << 4 | len(self.text) >> 8), chr(len(self.text) & 0xFF) ]
+
+	# Header -> 4bit speed, 4 bit delay, 4 bit direction, 4 bit zero
+	def getHeader(self):
+		return [chr(self.speed << 4 | self.delay), chr(self.direction << 4 | 0x00)]
+
+	def getRepresentation(self):
+		retval = []
+		retval.extend(self.getFrameHeader())
+		retval.extend(self.getHeader())
+		retval.extend(list(self.text))
+		return retval
+
+class animationFrame(Frame):
+	animation = []
+	speed = 0
+	delay = 0
+	# identifier as per specification: 0010	
+	identifier = 0x02
+
+	def __init__(self,animation,speed=13,delay=0):
+		self.setAnimation(animation)
+		self.setSpeed(speed)
+		self.setDelay(delay)
+
+	def setAnimation(self,animation):
+		if len(animation) % 8 is not 0:
+			raise Exception
+		else:
+			self.animation = animation
+
+	def setSpeed(self,speed):
+		self.speed = speed if speed < 16 else 1
+
+	def setDelay(self,delay):
+		self.delay = delay if delay < 16 else 0
+
+	# Frame header: 4 bit type + 12 bit length
+	def getFrameHeader(self):
+		return [chr(self.identifier << 4 | len(self.animation) >> 8), chr(len(self.animation) & 0xFF) ]
+
+	# Header -> 4bit zero, 4bit speed, 4 bit zero, 4 bit direction
+	def getHeader(self):
+		return [chr(self.speed), chr(self.delay)]
+
+	def getRepresentation(self):
+		retval = []
+		retval.extend(self.getFrameHeader())
+		retval.extend(self.getHeader())
+		retval.extend(self.animation)
+		return retval
+
+
+class blinkenrocket():
+
+	eeprom_size = 65536
+	startcode = chr(0x99)
+	patterncode = chr(0xA9)
+	endcode = chr(0x84)
+	frames = []
+
+	def __init__(self,eeprom_size=65536):
+		self.eeprom_size = eeprom_size if eeprom_size < 256*1024*1024 else 65536
+	
+	def addFrame(self, frame):
+		if not isinstance(frame, Frame):
+			raise RuntimeError("Incorrect frame supplied")
+		else:
+			self.frames.append(frame)
+
+	def getMessage(self):
+		output = [self.startcode, self.startcode]
+		for frame in self.frames:
+			output.extend([self.patterncode,self.patterncode])
+			output.extend(frame.getRepresentation())
+		output.extend([self.endcode,self.endcode])
+		return output
+
+
+
+
+if __name__ == '__main__':
+	m = modem(parity=True, frequency=48000)
+	b = blinkenrocket()
+
+	for message in sys.argv[2:]:
+		b.addFrame(textFrame(message, speed=13))
+	b.addFrame(textFrame(" \x04 "))
+	b.addFrame(animationFrame(map(lambda x : chr(x), [0, 0, 0, 0, 0, 0, 0, 0, 255, 255, 255, 255, 255, 255, 255, 255]), speed=0))
+	b.addFrame(animationFrame(map(lambda x : chr(x), [
+	  1,   0,   0,   0,   0,   0,   0,   0,
+	  0,   1,   0,   0,   0,   0,   0,   0,
+	  0,   0,   1,   0,   0,   0,   0,   0,
+	  0,   0,   0,   1,   0,   0,   0,   0,
+	  0,   0,   0,   0,   1,   0,   0,   0,
+	  0,   0,   0,   0,   0,   1,   0,   0,
+	  0,   0,   0,   0,   0,   0,   1,   0,
+	  0,   0,   0,   0,   0,   0,   0,   1,
+	  0,   0,   0,   0,   0,   0,   0,   2,
+	  0,   0,   0,   0,   0,   0,   0,   4,
+	  0,   0,   0,   0,   0,   0,   0,   8,
+	  0,   0,   0,   0,   0,   0,   0,   16,
+	  0,   0,   0,   0,   0,   0,   0,   32,
+	  0,   0,   0,   0,   0,   0,   0,   64,
+	  0,   0,   0,   0,   0,   0,   0,   128,
+	  0,   0,   0,   0,   0,   0, 128,   0,
+	  0,   0,   0,   0,   0, 128,   0,   0,
+	  0,   0,   0,   0, 128,   0,   0,   0,
+	  0,   0,   0, 128,   0,   0,   0,   0,
+	  0,   0, 128,   0,   0,   0,   0,   0,
+	  0, 128,   0,   0,   0,   0,   0,   0,
+	128,   0,   0,   0,   0,   0,   0,   0,
+	 64,   0,   0,   0,   0,   0,   0,   0,
+	 32,   0,   0,   0,   0,   0,   0,   0,
+	 16,   0,   0,   0,   0,   0,   0,   0,
+	  8,   0,   0,   0,   0,   0,   0,   0,
+	  4,   0,   0,   0,   0,   0,   0,   0,
+	  2,   0,   0,   0,   0,   0,   0,   0,
+	  0,   2,   0,   0,   0,   0,   0,   0,
+	  0,   0,   2,   0,   0,   0,   0,   0,
+	  0,   0,   0,   2,   0,   0,   0,   0,
+	  0,   0,   0,   0,   2,   0,   0,   0,
+	  0,   0,   0,   0,   0,   2,   0,   0,
+	  0,   0,   0,   0,   0,   0,   2,   0,
+	  0,   0,   0,   0,   0,   0,   4,   0,
+	  0,   0,   0,   0,   0,   0,   8,   0,
+	  0,   0,   0,   0,   0,   0,  16,   0,
+	  0,   0,   0,   0,   0,   0,  32,   0,
+	  0,   0,   0,   0,   0,   0,  64,   0,
+	  0,   0,   0,   0,   0,  64,   0,   0,
+	  0,   0,   0,   0,  64,   0,   0,   0,
+	  0,   0,   0,  64,   0,   0,   0,   0,
+	  0,   0,  64,   0,   0,   0,   0,   0,
+	  0,  64,   0,   0,   0,   0,   0,   0,
+	  0,  32,   0,   0,   0,   0,   0,   0,
+	  0,  16,   0,   0,   0,   0,   0,   0,
+	  0,   8,   0,   0,   0,   0,   0,   0,
+	  0,   4,   0,   0,   0,   0,   0,   0,
+	  0,   0,   4,   0,   0,   0,   0,   0,
+	  0,   0,   0,   4,   0,   0,   0,   0,
+	  0,   0,   0,   0,   4,   0,   0,   0,
+	  0,   0,   0,   0,   0,   4,   0,   0,
+	  0,   0,   0,   0,   0,   8,   0,   0,
+	  0,   0,   0,   0,   0,  16,   0,   0,
+	  0,   0,   0,   0,   0,  32,   0,   0,
+	  0,   0,   0,   0,  32,   0,   0,   0,
+	  0,   0,   0,  32,   0,   0,   0,   0,
+	  0,   0,  32,   0,   0,   0,   0,   0,
+	  0,   0,  16,   0,   0,   0,   0,   0,
+	  0,   0,   8,   0,   0,   0,   0,   0,
+	  0,   0,   0,   8,   0,   0,   0,   0,
+	  0,   0,   0,   0,   8,   0,   0,   0,
+	  0,   0,   0,   0,  16,   0,   0,   0,
+	  0,   0,   0,  16,   0,   0,   0,   0,
+	  0,   0,   0,  24,  24,   0,   0,   0,
+	  0,   0,  60,  36,  36,  60,   0,   0,
+	  0, 126,  66,  66,  66,  66, 126,   0,
+	255, 129, 129, 129, 129, 129, 129, 255,
+	  0,   0,   0,   0,   0,   0,   0,   0,
+	]), speed=15, delay=1))
+	b.addFrame(animationFrame(map(lambda x : chr(x), [
+	  0,   0,   0,  24,  24,   0,   0,   0,
+	  0,   0,  60,  36,  36,  60,   0,   0,
+	  0, 126,  66,  66,  66,  66, 126,   0,
+	255, 129, 129, 129, 129, 129, 129, 255,
+	  0,   0,   0,   0,   0,   0,   0,   0,
+	]), speed=14, delay=1))
+
+	m.setData(b.getMessage())
+	m.saveAudio(sys.argv[1])
+
+	#print b.getMessage()
+
+
diff --git a/utilities/flasher.py b/utilities/flasher.py
new file mode 100644
index 0000000..b39d913
--- /dev/null
+++ b/utilities/flasher.py
@@ -0,0 +1,78 @@
+#!/usr/bin/python
+
+import sys
+import os
+from termcolor import colored
+
+try:
+    import tty, termios
+except ImportError:
+    try:
+        import msvcrt
+    except ImportError:
+        raise ImportError('getch not available')
+    else:
+        getch = msvcrt.getch
+else:
+    def getch():
+        """getch() -> key character
+
+        Read a single keypress from stdin and return the resulting character. 
+        Nothing is echoed to the console. This call will block if a keypress 
+        is not already available, but will not wait for Enter to be pressed. 
+
+        If the pressed key was a modifier key, nothing will be detected; if
+        it were a special function key, it may return the first character of
+        of an escape sequence, leaving additional characters in the buffer.
+        """
+        fd = sys.stdin.fileno()
+        old_settings = termios.tcgetattr(fd)
+        try:
+            tty.setraw(fd)
+            ch = sys.stdin.read(1)
+        finally:
+            termios.tcsetattr(fd, termios.TCSADRAIN, old_settings)
+        return ch
+
+code_okay = """
+ #######  ##    ##    ###    ##    ## 
+##     ## ##   ##    ## ##    ##  ##  
+##     ## ##  ##    ##   ##    ####   
+##     ## #####    ##     ##    ##    
+##     ## ##  ##   #########    ##    
+##     ## ##   ##  ##     ##    ##    
+ #######  ##    ## ##     ##    ##  
+"""
+
+code_error = """
+######## ########  ########   #######  ########  
+##       ##     ## ##     ## ##     ## ##     ## 
+##       ##     ## ##     ## ##     ## ##     ## 
+######   ########  ########  ##     ## ########  
+##       ##   ##   ##   ##   ##     ## ##   ##   
+##       ##    ##  ##    ##  ##     ## ##    ##  
+######## ##     ## ##     ##  #######  ##     ## 
+"""
+
+def printOkay():
+	print colored(code_okay, 'green')
+
+def printError():
+	print colored(code_error, 'red')
+
+flash_command = sys.argv[1]
+
+print colored("Using the following command to flash: %s" % flash_command, "green")
+
+while True:
+	print colored("Press any key to continue or 'q' to quit.","yellow")
+	char = getch()
+	print char
+	if ord(char) is ord('q'):
+		sys.exit(0)
+	return_code = os.system(flash_command)
+	if return_code > 0:
+		printError()
+	else:
+		printOkay()
+
diff --git a/utilities/font_to_json.py b/utilities/font_to_json.py
new file mode 100644
index 0000000..6d1b667
--- /dev/null
+++ b/utilities/font_to_json.py
@@ -0,0 +1,27 @@
+#!/usr/bin/python
+
+import sys
+import os
+import re
+import json
+
+result = {}
+
+with open('font.h') as font:
+	for line in font:
+		if 'PROGMEM' in line:
+			hexes = re.findall(r'(0x[0-9a-fA-F]+)',line)
+			contents = hexes[1:]
+			length = len(contents)
+			literal = int(re.findall(r'chr_([0-9]+)',line)[0])
+			description = re.findall(r'\/\/(.*)$',line)[0].strip()
+			#for row in contents:
+			#	print '{0:08b}'.format(int(row,16)) #.replace("1",u"\u2588").replace("0",u"\u25A2")
+			result[str(literal)] = {
+				'literal' : literal,
+				'description' : description,
+				'hexcolumns' : contents,
+				'length' : length
+			}
+
+print json.dumps(result)
diff --git a/utilities/mirror_font.py b/utilities/mirror_font.py
new file mode 100644
index 0000000..db5b5c3
--- /dev/null
+++ b/utilities/mirror_font.py
@@ -0,0 +1,25 @@
+#!/usr/bin/python
+
+import sys
+import os
+import re
+import json
+
+result = {}
+
+with open('font.h') as font:
+	for line in font:
+		if 'PROGMEM' in line:
+			hexes = re.findall(r'(0x[0-9a-fA-F]+)',line)
+			prefix = hexes[:1]
+			contents = hexes[1:]
+			length = len(contents)
+			literal = int(re.findall(r'chr_([0-9]+)',line)[0])
+			description = re.findall(r'\/\/(.*)$',line)[0].strip()
+			newhexes = []
+			newhexes.append(prefix[0])
+			for row in contents:
+				bitstring = '{0:08b}'.format(int(row,16))
+				newbits = bitstring[::-1]
+				newhexes.append( format(int(newbits,2), '#04x'))
+			print "const unsigned char PROGMEM chr_%s[] = {%s}; // %s" % (literal,','.join(newhexes),description)
diff --git a/utilities/modem_transmit b/utilities/modem_transmit
new file mode 100755
index 0000000..bb18850
--- /dev/null
+++ b/utilities/modem_transmit
@@ -0,0 +1,16 @@
+#!/bin/sh
+
+OUT="$(mktemp)"
+trap "rm -f '$OUT'" EXIT INT QUIT TERM
+
+python blinkenrocket.py $OUT "$@"
+
+case "$(uname -s)" in
+Darwin)
+    play $OUT
+    ;;
+Linux)
+    aplay $OUT
+    ;;
+esac
+
diff --git a/utilities/test_blinkenrocket.py b/utilities/test_blinkenrocket.py
new file mode 100644
index 0000000..62bd0e3
--- /dev/null
+++ b/utilities/test_blinkenrocket.py
@@ -0,0 +1,117 @@
+#!/usr/bin/python
+import unittest
+from blinkenrocket import *
+
+class TestFrame(unittest.TestCase):
+
+  def test_notImplemented(self):
+      frame = Frame()
+      with self.assertRaises(NotImplementedError):
+        frame.getRepresentation()
+
+class TestAnimation(unittest.TestCase):
+
+  def test_speedDefault(self):
+    anim = animationFrame([])
+    self.assertEquals(ord(anim.getHeader()[0]),1)
+
+  def test_speedOkay(self):
+    anim = animationFrame([],speed=7)
+    self.assertEquals(ord(anim.getHeader()[0]),7)
+
+  def test_speedNotOkay(self):
+    anim = animationFrame([],speed=70)
+    self.assertEquals(ord(anim.getHeader()[0]),1)
+
+  def test_delayDefault(self):
+    anim = animationFrame([])
+    self.assertEquals(ord(anim.getHeader()[1]),0)
+
+  def test_delayOkay(self):
+    anim = animationFrame([],delay=7)
+    self.assertEquals(ord(anim.getHeader()[1]),7)
+
+  def test_delayNotOkay(self):
+    anim = animationFrame([],delay=70)
+    self.assertEquals(ord(anim.getHeader()[1]),0)
+
+  def test_illegalLength(self):
+    with self.assertRaises(Exception):
+      anim = animationFrame([0x11,0x12,0x13,0x14])
+
+  def test_allowedLength(self):
+    anim = animationFrame([0x11,0x12,0x13,0x14,0x15,0x16,0x17,0x18])
+
+  def test_defaultHeaderOK(self):
+    anim = animationFrame([])
+    self.assertEquals(anim.getHeader(),[chr(1),chr(0)])
+
+  def test_differentHeaderOK(self):
+    anim = animationFrame([],speed=7,delay=8)
+    self.assertEquals(anim.getHeader(),[chr(7),chr(8)])
+
+class TestText(unittest.TestCase):
+
+  def test_speedDefault(self):
+    text = textFrame([])
+    self.assertEquals(ord(text.getHeader()[0]),(1 << 4 | 0))
+
+  def test_speedOkay(self):
+    text = textFrame([],speed=7)
+    self.assertEquals(ord(text.getHeader()[0]),(7 << 4 | 0))
+
+  def test_speedNotOkay(self):
+    text = textFrame([],speed=70)
+    self.assertEquals(ord(text.getHeader()[0]),(1 << 4 | 0))
+
+  def test_delayDefault(self):
+    text = textFrame([])
+    self.assertEquals(ord(text.getHeader()[0]),(1 << 4 | 0))
+
+  def test_delayOkay(self):
+    text = textFrame([],delay=7)
+    self.assertEquals(ord(text.getHeader()[0]),(1 << 4 | 7))
+
+  def test_delayNotOkay(self):
+    text = textFrame([],delay=70)
+    self.assertEquals(ord(text.getHeader()[0]),(1 << 4 | 0))
+
+  def test_directionDefault(self):
+    text = textFrame([])
+    self.assertEquals(ord(text.getHeader()[1]),0)
+
+  def test_directionOkay(self):
+    text = textFrame([],direction=1)
+    self.assertEquals(ord(text.getHeader()[1]),(1 << 4 | 0))
+
+  def test_directionNotOkay(self):
+    text = textFrame([],direction=7)
+    self.assertEquals(ord(text.getHeader()[1]),0)
+
+  def test_defaultHeaderOK(self):
+    text = textFrame([])
+    self.assertEquals(text.getHeader(),[chr(1 << 4 | 0),chr(0)])
+
+  def test_differentHeaderOK(self):
+    text = textFrame([],speed=7,delay=8,direction=1)
+    self.assertEquals(text.getHeader(),[chr(7 << 4 | 8),chr(1 << 4 | 0)])
+
+class TestBlinkenrocket(unittest.TestCase):
+
+  def test_addFrameFail(self):
+    br = blinkenrocket()
+    with self.assertRaises(Exception):
+      br.addFrame([])
+
+  def test_addFrameText(self):
+    text = textFrame("MUZY",speed=7,delay=8,direction=1)
+    self.assertEquals(text.getFrameHeader(),[chr(0x01 << 4), chr(4)])
+    self.assertEquals(text.getHeader(),[chr(7 << 4 | 8),chr(1 << 4 | 0)])
+    self.assertEquals(text.getRepresentation(),[chr(0x01 << 4), chr(4),chr(7 << 4 | 8),chr(1 << 4 | 0),'M','U','Z','Y'])
+    br = blinkenrocket()
+    br.addFrame(text)
+    expect = [chr(0x99),chr(0x99),chr(0xA9),chr(0xA9),chr(0x01 << 4), chr(4),chr(7 << 4 | 8),chr(1 << 4 | 0),'M','U','Z','Y',chr(0x84),chr(0x84)]
+    self.assertEquals(br.getMessage(),expect)
+
+if __name__ == '__main__':
+    unittest.main()