One efficient implementation of accumulation in fi
2016-08-23
0 0 0
no vote
Other
Earn points
Finite field Accumulation is the simplest and most encountered operations in Finite Field Arithmetic.
Using Finite Field Accumulator with T flip-flops the Structures of bit level and digit level serial/parallel multiplier
over GF (2m) are derived using both general Polynomials as well as Trinomials and implemented. This finite field
multiplier is later implemented on FPGA. The area time complexity and critical path are reduced in this
implementation
verilog
有限
高效
实现
Related Source Codes
AXI Host Slave Function Model
0
0
no vote
Axi slave to fifo code
0
0
no vote
DMA Controller Based on AHB
0
0
no vote
Verilog implementation of ldpc code
0
0
no vote
Minimum sum decoding
0
0
no vote
No comment