Skip to content

feat: Optimized Compression#9

Open
osmanyasar05 wants to merge 4 commits into
mainfrom
better_compress
Open

feat: Optimized Compression#9
osmanyasar05 wants to merge 4 commits into
mainfrom
better_compress

Conversation

@osmanyasar05
Copy link
Copy Markdown
Collaborator

This PR implements a new compressor implementation, that compresses in a more balanced way, from the front and the back of the list in parallel.

Copy link
Copy Markdown

@cowardsa cowardsa left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

This is fine and great that it drops out easily - but I think its not a direction we want to pursue further. As in the textbook, you'll notice that a compressor is really composed of independent stages (as you drew in the paper).

I suspect a structure that uses a CompressorStage that takes a List of n-bitvectors (each of width m), and produces a List of k-bitvectors where k<n, our proof is then that the sum of the output List is the same as the sum of the input List. By chaining stages you'll eventually reduce the list. Within each stage you can apply FAs in parallel (to any degree) i.e. floor(n/3) FAs.

If that is unclear please direct questions to zulip perhaps?

simp
unfold chain_opt at ih ⊢
clear ih hrest
sorry
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Is this problematic?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants