Explore >> Select a destination
|
You are here 
|
rupertmckay.com | ||
| | | | |
projectf.io
|
|
| | | | | Sometimes you need more precision than integers can provide, but floating-point computation is not trivial (try reading IEEE 754). You could use a library or IP block, but simple fixed point maths can often get the job done with little effort. Furthermore, most FPGAs have dedicated DSP blocks that make multiplication and addition of integers fast; we can take advantage of that with a fixed-point approach. | |
| | | | |
golb.hplar.ch
|
|
| | | | | ||
| | | | |
esham.io
|
|
| | | | | Yet another demonstration of why you should store monetary amounts in integers. | |
| | | | |
imapenguin.com
|
|
| | | What is an LFSR? An LFSR is a Linear Feedback Shift Register. It's a simple way of generating a sequence of numbers that look random. Used in cryptography and in generating pseudo-random numbers, they are interesting because they are so simple. Shift bits and feed a few of them back into the sequence. That's it. Important note: LFSRs are not cryptographically secure on their own. ESPECIALLY 8-bit LFSRs. More on that in the next post on this topic. | ||
