Hi I am trying to calculate the abs or a float number $x$, however, I want to apply this operation when $x$ is under fully homomorphic encryption (typically CKKS Scheme). So I come up with the idea that if we can use only addition and multiplication (some constant value like $2^k$ could be involved) to get abs, then we can just encrypt the whole operation and thus get an abs for encrypted data.
Note that here I am only dealing with the float point in some specific range, e.g., $-2^{28}\le x\le 2^{28}$, so I'm pretty sure at least there must exists some particular and-xor circuit for abs in general case.
But to directly adapt the abs operation of the float point to the homomorphic encryption scheme, I can't come up with some arithmetic methods to deal with it. Could any please offer me some help?
