03-22-2017, 05:42 AM
A few things:
1: Tree-based multiplication has been done before in minecraft. The ones I built added pairs of parallel partial products for O(log_2(n)) layers of adders. I'm pretty sure you can find a 10bit one on my old plot at /warp newo (if that still works). Wallace trees appear to be a formalization of this process.
2: IIRC Mar_Win made a pretty decent CORDIC unit a while back.
3: You guys should make some LFSR circuits because they're really interesting (https://en.wikipedia.org/wiki/Linear-fee...t_register)
4: Hardware mergesort is a thing. It's called a Batcher sorting network. Here's an interesting article/paper about it: https://mitpress.mit.edu/sites/default/f...r%2027.pdf
5: Implement stochastic logic for computing polynomials: http://cadbio.com/wiki/images/6/64/Qian_...treams.pdf
6: Implement basic neural networks
7: Build a good FPGA in MC
1: Tree-based multiplication has been done before in minecraft. The ones I built added pairs of parallel partial products for O(log_2(n)) layers of adders. I'm pretty sure you can find a 10bit one on my old plot at /warp newo (if that still works). Wallace trees appear to be a formalization of this process.
2: IIRC Mar_Win made a pretty decent CORDIC unit a while back.
3: You guys should make some LFSR circuits because they're really interesting (https://en.wikipedia.org/wiki/Linear-fee...t_register)
4: Hardware mergesort is a thing. It's called a Batcher sorting network. Here's an interesting article/paper about it: https://mitpress.mit.edu/sites/default/f...r%2027.pdf
5: Implement stochastic logic for computing polynomials: http://cadbio.com/wiki/images/6/64/Qian_...treams.pdf
6: Implement basic neural networks
7: Build a good FPGA in MC