I have a question on counting the number of occurrences of zero in a 6 bit binary number using solely half and full adders.
My original solution had 2 FA that each sum 3 bits, with inverters stuck to the outputs which then feed into a HA and a FA which produce a 3 bit number. The inverters switch the adders from producing the number of ones in a number to the number of zeros. However I am not allowed to use inverters and was suggested to create an inverter out of HAs or FAs.
Any help or clarification on how I could go about this problem is greatly appreciated.
My original solution had 2 FA that each sum 3 bits, with inverters stuck to the outputs which then feed into a HA and a FA which produce a 3 bit number. The inverters switch the adders from producing the number of ones in a number to the number of zeros. However I am not allowed to use inverters and was suggested to create an inverter out of HAs or FAs.
Any help or clarification on how I could go about this problem is greatly appreciated.