2007•Electronics LettersRequires access

Efficient Hamming weight comparators of binary vectors

S.J. Piestrak

Abstract

New comparators of the Hamming weight of binary vectors built using threshold circuits are proposed. One version compares the Hamming weight of a binary vector to a fixed threshold, whereas the other compares the Hamming weights of two independent vectors. Their applications include digital neural networks, pattern matching and median/rank filters.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 23 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Hamming(7,4), Hamming weight, Hamming distance, Hamming code, Binary number, Hamming bound, Mathematics, Hamming graph