Is it possible to synthesize the function y = mod(x,1) in hardware? I know it's possible to do modulo operations with powers of two. Is this valid for one, too? The input of the mod - function is a 16.12 signed fractional. Any hints how to realize it?
You can do modulo operations with non-powers of two also. Powers of two are just very convenient in binary as you just have to strip away some LSBs. For other numbers, you can do it either sequentially or combinatorial (single cycle). A number of papers exist to explain the principles of both.
I am a bit puzzeled about your question as %1 seems like a very trivial case for integers. Can you provide some examples of what should come out of your mod 1 operator for a signed fractional?