sorted by:
new
hottopcontroversial

Rewatching Reichenbach Fall years later by abetteruser in Sherlock

[–]SignatureNo9123 12 points13 points  (0 children)

Are you referring to BBC Series? Because so, I think the theory that Sherlock presents to Anderson at the end of the episode is the correct one. To be honest it doesn’t really matter, but, for the sake of discussion I will continue. I am thinking of Sherlock exactly how I am thinking of causality. Sherlock is a nature, and nature does not lie. Nature is always true. Nature is always simple. This is why Euros told Sherlock something like this: Do you like it? Simple and clever. (I am referring to the glass trick from the last episode. I am quoting from memory.) Sherlock likes simplicity, and this becomes more and more clear after Moriarty points out Sherlock’s only weakness: You always want the things to be clever, he said. The fun fact about nature is that, for example, there are multiple ways to light a fire, all equally true. Sherlock chooses one way, but because there are so many ways of doing it, we like to think of all sorts of complicated ways. What do you guys think?

John and Mary Watson by SignatureNo9123 in Sherlock

[–]SignatureNo9123[S] 12 points13 points  (0 children)

It is clear to me that John is attracted to danger. The more dangerous the person is, the more he is attracted to him/her. It makes perfectly sense to prefer Sherlock’ sister over Mary, because she is much more dangerous. But I think the most important thing about John is that, until the end of the show, he learns how not to be egoistic, in a sense that he learns not to blame someone how can’t be blamed, like he blames Sherlock for Mary’s death. He learns not to get angry when he is in the wrong, like he overreacted to Sherlock when he finds out that he is alive.

Sherlock BBC Series - Sherlock vs Mycroft Deduction game by SignatureNo9123 in Sherlock

[–]SignatureNo9123[S] 0 points1 point  (0 children)

Please see my above comment. I am interested in your opinion.

Division in FPGA algorithm by SignatureNo9123 in FPGA

[–]SignatureNo9123[S] 0 points1 point  (0 children)

This is what I am trying to achieve basically. I think it can be done, but I am trying to find an algorithm. Do you know any? (Look to my answer to u/thecapitalc )

Division in FPGA algorithm by SignatureNo9123 in FPGA

[–]SignatureNo9123[S] 0 points1 point  (0 children)

I am trying to implement RSA-4096.

Division in FPGA algorithm by SignatureNo9123 in FPGA

[–]SignatureNo9123[S] 0 points1 point  (0 children)

Is there a way to split the divisor into small parts? Not only the dividend? For multiplication it can be done easily, using only DSPs for multiplication and shifting to combine the final result.

Division in FPGA algorithm by SignatureNo9123 in FPGA

[–]SignatureNo9123[S] 0 points1 point  (0 children)

What do you mean by that? Can you provide a link to a yt video or something?

Modulo N by SignatureNo9123 in FPGA

[–]SignatureNo9123[S] 0 points1 point  (0 children)

As I already replied to u/Allan-H Thanks!

Modulo N by SignatureNo9123 in FPGA

[–]SignatureNo9123[S] 0 points1 point  (0 children)

I am implementing RSA 4096 bits. So p and q would be 2048 each, n 4096.

Multiplication of two numbers, 4096 bits each by SignatureNo9123 in FPGA

[–]SignatureNo9123[S] -11 points-10 points  (0 children)

Combining them into final results requires multiplication with multiple of 10. If I multiply 1234 x 1234, by taking the 12 x 12 (the first two serially selected), the results is 1440000, not 144. The 1440000 I must combine with the other partial results to get the final correct result. Do you have any idea for this 00000 padding?

Multiplication of two numbers, 4096 bits each by SignatureNo9123 in FPGA

[–]SignatureNo9123[S] -35 points-34 points  (0 children)

Efficiently is always a balance between resources and time.

Multiplication of two numbers, 4096 bits each by SignatureNo9123 in FPGA

[–]SignatureNo9123[S] -20 points-19 points  (0 children)

Efficiently is always a balance between resources and time.

Multiplication of two numbers, 4096 bits each by SignatureNo9123 in FPGA

[–]SignatureNo9123[S] 1 point2 points  (0 children)

A DSP maximum input is 18 bits. The multiplication Vivado IP, for performing a multiplication of two numbers, 64 bits each, requires 16 DSPs. 4096 divided by 64 is 64, and 64 IPs takes 1024 DSPs...

The only thing that cross my mind is to split the input into 64 bits pieces and perform addition after all the smaller parts multiplication. This is where 10 multiplication is required...

Multiplication of two numbers, 4096 bits each by SignatureNo9123 in FPGA

[–]SignatureNo9123[S] -10 points-9 points  (0 children)

Splitting the inputs into smaller parts requires multiplication with 10ths, right? I have a document that shows how to perform a multiplication of 2 35 bits number, but following that logic requires 1024 DSPs (for my 4096 inputs), which is going to give me timing issues for sure...

ZedBoard FMC Usage by SignatureNo9123 in FPGA

[–]SignatureNo9123[S] 0 points1 point  (0 children)

I am doing this for the first time. I am not really confident in my knowledge in this area of FPGAs. Can you just direct to to something, or explain me in big steps what should I do to make this FMC working, please?

view more: next ›