Fast constant weight codeword to index converter
MWSCAS2011_butler.pdf (174.0Kb)Abstract
Constant weight codewords, in which the number
of 1’s is constant, are essential to combinatorial computing. For
example, it is often useful to generate all subsets of a set with
a fixed number of elements. In this paper, we show an efficient
circuit that converts a constant weight codeword into a unique
index of that codeword. This circuit is a necessary part of a circuit
that uses constant weight codewords to transmit data on and off
chip. Our circuit is based on the combinatorial number system
in which the digits are binomial coefficients n
r. Experimental
results show the efficiency of our design.
Description
The 54th IEEE International Midwest Symposium on Circuits and Systems, Korea August 7-10, 2011, CDROM, pp.1-4.
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, may not be copyrighted.
Collections
Related items
Showing items related by title, author, creator and subject.
-
Natural convection immersion cooling of an array of vertically oriented heated protrusions in an enclosure filled with a dielectric liquid: effects of enclosure width, Prandtl number and component orientation
(Monterey, California. Naval Postgraduate School, 1991-12);The natural convection heat transfer characteristics of a 3X3 array of vertical oriented heated protrusions, immersed in a dielectric liquid, were investigated. Aluminum blocks, 24mm x 8mm x 6mm, were used to simulate 20 ... -
Analog preprocessing in a SNS 2 [mu] low-noise CMOS folding ADC
(Monterey, California. Naval Postgraduate School, 1994-12);Significant research in high performance analog-to-digital converters (ADCs) has been directed at retaining part of the high-speed flash ADC architecture, while reducing the total number of comparators in the circuit. The ... -
Hardware index to permutation converter
(2012-05);We demonstrate a circuit that generates a permutation in response to an index. Since there are n! n-element permutations, the index ranges from 0 to n! à ¢ 1. Such a circuit is needed in the hardware implementation of ...
