Sum of n numbers 0..1
user_at_domain.invalid
Date: 10/21/04
- Previous message: Alex Vinokur: "Re: Turing Machine with faults, failures and recovery"
- Next in thread: Paul E. Black: "Re: Sum of n numbers 0..1"
- Reply: Paul E. Black: "Re: Sum of n numbers 0..1"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Thu, 21 Oct 2004 12:08:00 +0200
There are n inputs, each having value 0 or 1, and I need to
calculate the number of 1s (i.e. take the sum of n numbers
in the range 0..1) and have the output in binary.
The number n may be very high, thousands, tens of thousands.
What are the smallest and most efficient circuits/formulas
for doing this?
(n inputs and about log2 n outputs for the sum in binary.)
Alternatively, I just want to know whether the sum exceeds some
threshold k with 0 <= k < n.
Best regards,
Jussi R.
- Previous message: Alex Vinokur: "Re: Turing Machine with faults, failures and recovery"
- Next in thread: Paul E. Black: "Re: Sum of n numbers 0..1"
- Reply: Paul E. Black: "Re: Sum of n numbers 0..1"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|