Continue to Site

Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

How to compute Hamming Distance without bit-level process

Status
Not open for further replies.

khorram

Full Member level 4
Full Member level 4
Joined
Oct 27, 2004
Messages
211
Helped
13
Reputation
26
Reaction score
1
Trophy points
1,298
Activity points
1,892
Hi everybody,

I need to know if there is any article/paper/algorithm that discusses about how I can compute Hamming Distance without having to take into account the two codewords in bit-level. In other words, Is there any algorithm to compute hamming distance between two positive integer number by using arithmetic operations without any bit-level processing.

WRG,
KH
 

Re: How to compute Hamming Distance without bit-level proces

add the two code words then the weight of the resullt (number of ones) is the hamming distance
 

Status
Not open for further replies.

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Back
Top