Parallel prefix tree generation and exploration
1.2.6
  • pptrees package
  • Tutorial
    • Trees [structures that generate one bit of the result]
    • Forests [structures that generate the entire result]
  • Theory and Discussion
Parallel prefix tree generation and exploration
  • »
  • Tutorial
  • Edit on GitHub

Tutorial¶

  • Trees [structures that generate one bit of the result]
    • Setup (RUN ME before executing any code in this section)
    • Generating a classic structure [LEGACY]
    • How many possible trees are there?
    • What do all of these trees look like?
    • How do I get the tree that I want?
    • Okay, I have a tree. How do I make it faster?
    • Okay, now how do I make a tree more power-efficient? Or smaller?
      • How do I get the ID of a tree after I’ve modified it?
      • Obtaining a PNG diagram
      • Obtaining an HDL description
  • Forests [structures that generate the entire result]
    • Setup (RUN ME before executing any code in this section)
    • Generating a classic structure [LEGACY]
    • How many possible forests are there?
    • What do these forests look like?
    • How do I get the forest that I want?
    • Okay, I have a forest. How do I make it faster?
    • Okay, now how do I make a forest more power-efficient? Or smaller?
    • What about fan-out decoupling / buffer insertion?
      • But wait! Buffer insertion is the whole point of important classic structures such as Brent-Kung!
      • Buffer insertion using this library
      • Obtaining an HDL description
Previous Next

© Copyright Teodor-Dumitru Ene.

Built with Sphinx using a theme provided by Build the Docs.