US 12,379,898 B1
Asynchronous full-adder with majority or minority gates to generate sum false output
Nabil Imam, Atlanta, GA (US); Amrita Mathuriya, Portland, OR (US); Ikenna Odinaka, Durham, NC (US); Rafael Rios, Austin, TX (US); Rajeev Kumar Dokania, Beaverton, OR (US); and Sasikanth Manipatruni, Portland, OR (US)
Assigned to Kepler Computing Inc., San Francisco, CA (US)
Filed by Kepler Computing Inc., San Francisco, CA (US)
Filed on Feb. 7, 2022, as Appl. No. 17/650,226.
Application 17/650,226 is a continuation of application No. 17/650,196, filed on Feb. 7, 2022.
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 7/501 (2006.01)
CPC G06F 7/501 (2013.01) 14 Claims
OG exemplary drawing
 
1. An apparatus comprising:
a first data channel comprising two first inputs and a first acknowledgement output;
a second data channel comprising two second inputs and a second acknowledgement output;
a third data channel comprising two carry inputs and a third acknowledgement output;
a fourth data channel comprising two carry outputs and a third acknowledgement input;
a fifth data channel comprising two sum outputs and a fourth acknowledgement input; and
a full-adder coupled to the first data channel, the second data channel, the third data channel, the fourth data channel, and the fifth data channel, wherein the full-adder comprises majority and/or minority gates some of which receive the two first inputs, the two second inputs, the two carry inputs, the third acknowledgement input, and the fourth acknowledgement input, and generate controls to control gates of transistors, wherein the transistors are coupled to generate the two carry outputs, the two sum outputs, the first acknowledgement output, the second acknowledgement output, and the third acknowledgement output, and wherein the full-adder comprises a circuitry to generate a sum false output of the two sum outputs.