作者: Yunfu Shen , Benpeng Jiang , Yi Jin , Ouyang Shan , Junjie Peng
关键词:
摘要: In this paper, we focus on the M-k-B addition of form M þ B1 B2 :::þ Bk based an optical approach, where is a modified signed-digit number and Bi's are binary numbers. We present three trans- forms C, P, R algorithm carry-free parallel B. Based these transforms, accumulation computing proposed which indicates that it requires only 2k steps to complete in parallel. Then, structures for transforms as well adder realizing B designed. Moreover, photoelectric implementation ternary realize M-1-B structure using reconfiguration method presented. Additionally, experiment 2-bit M-2-B carried out demonstrate feasibility adder. The work M0 easily completed. © Authors. Published by SPIE under Creative Commons Attribution 3.0 Unported License. Distribution or reproduction whole part full attribution original publication, including its DOI. (DOI: 10.1117/1.OE.53.9.095108)