Efficient hamming weight comparators for binary vectors based on accumulative and up/down parallel counters

Authors:
Behrooz Parhami
Affiliations:
Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA
Venue:
IEEE Transactions on Circuits and Systems II: Express Briefs
Year:
2009

Citing 8
Cited 1

Generalized Signed-Digit Number Systems: A Unifying Framework for Redundant Number Representations

IEEE Transactions on Computers
Bus-invert coding for low-power I/O

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Computer arithmetic: algorithms and hardware designs

Computer arithmetic: algorithms and hardware designs
Introduction to Parallel Processing: Algorithms and Architectures

Introduction to Parallel Processing: Algorithms and Architectures
Accumulative parallel counters

ASILOMAR '95 Proceedings of the 29th Asilomar Conference on Signals, Systems and Computers (2-Volume Set)
Area-Time Efficient Sign Detection Technique for Binary Signed-Digit Number System

IEEE Transactions on Computers
Impact of Parameter Variations on Circuits and Microarchitecture

IEEE Micro
Parallel Counters

IEEE Transactions on Computers

High-speed and low-power scalable Hamming weight comparator based on a non-weighted switched-capacitor array

Analog Integrated Circuits and Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

New counting-based methods for comparing the Hamming weight of a binary vector with a constant, as well as comparing the Hamming weights of two input vectors, are proposed. It is shown. that the proposed comparators are faster and simpler, both in asymptotic sense and for moderate vector lengths, compared with the best available fully digital designs. These speed and cost advantages result from a more efficient population counting, as well as the merger of counting and comparison operations, via accumulative and up/down parallel counters.