This can be summarized as 𝑧(𝑖+1)=1z(i+1)=1, meaning that (𝑥𝑖>𝑦𝑖)(xi>yi) or (𝑥𝑖=𝑦𝑖(xi=yi and 𝑧𝑖=1)zi=1). This summary is equivalent to the Boolean operation diagram shown in Figure 2. Figure 2. Boolean logic circuit. Therefore, for positive ...
This can be summarized as 𝑧(𝑖+1)=1z(i+1)=1, meaning that (𝑥𝑖>𝑦𝑖)(xi>yi) or (𝑥𝑖=𝑦𝑖(xi=yi and 𝑧𝑖=1)zi=1). This summary is equivalent to the Boolean operation diagram shown in Figure 2. Figure 2. Boolean logic circuit. Therefore, for positive ...