Efficient GF(2(m)) arithmetic clearly affects the performance of compute-intensive applications. A new low-complexityparallel-in/outsystolicab(2) multiplier based on the least significant bit-first scheme is presen...
详细信息
Efficient GF(2(m)) arithmetic clearly affects the performance of compute-intensive applications. A new low-complexityparallel-in/outsystolicab(2) multiplier based on the least significant bit-first scheme is presented. Compared with related works, the scheme yields significantly lower area-time complexity.
暂无评论