-
As we start to add support for different RLWE packings to HEIR, we will need to implement packing layout conversion operations and lowerings.
Once we have an attribute for layout (cf. https://githu…
j2kun updated
3 months ago
-
Investigate opportunities and costs of lossy packing and lossless compression of data.
* Packing: reducing the precision of the data to quantity-specific levels of precision
* lossy - by defin…
-
The only reason so far I'm not sure that Borsh is _perfect_ for Leaf is that it doesn't have any sort of compression for small integers.
If we want to keep the canonical property, then adding any s…
-
Currently, we use FIFO to pack blocks/chunks. This is nowhere near an optimal strategy to pack blocks/chunks (especially with #717).
We should devise some algorithm that is better at packing (maybe…
-
Hi, the algorithm works well and thanks for the beautiful repo!
i notice in a simple packing, a error while choosing the best box.
BOX1:
Inner Width Inner Length Inner Depth
260 4…
-
The algorithm (bottom up quad tree packing) is only good if all input textures are power-of-2 squares. Use a general bin packing algorithm, e.g. http://www.csc.liv.ac.uk/~epa/surveyhtml.html
crobi updated
13 years ago
-
Packing Devices from Two Separate Parts of a Netlist into a Single CLB
Hi VTR team,
I merged two netlists into a single BLIF file and used VPR to obtain its design solution on the architecture. Howe…
-
The current line packing algorithm lets you lay out a series of velements with arbitrarily complex layout problems. Simplify this by having three categories of boxes: rigid, elastic, and fill. The fol…
-
We do not want to tightly pack as we currently are, since it doesn't make sense.
Instead, boxes (container) must be diagonally stacked.
-
Although the spec doesn't necessarily need to prescribe a sector-packing algorithm, it is important that we know a viable one exists before we commit to requiring a maximum (even zero) allowable paddi…