I want to make a verilog module that calculates (A +/- B)mod p, where p is any prime. the result should remains between 0 to p-1. i am using xilinx ISE 14.1,, is there any operator that supports mod p and any suggestion??
If you want to write one, think about the steps you go through when you grab a pencil and paper and do long division, and then code that algorithm in Verilog.
If you want one already designed, look at the library of cores that Your FPGA vendor has provided.
If you want to write one, think about the steps you go through when you grab a pencil and paper and do long division, and then code that algorithm in Verilog.
If you want one already designed, look at the library of cores that Your FPGA vendor has provided.
i have one more question, m going to implement 16-bit complex number adder/subtractor in verilog, any hint to do addition and subtraction of complex numbers in hardware,,an example would be useful.