By Topic

On the design of constant weight codes for VLSI systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tallini, L.G. ; Dept. of Comput. Sci., Oregon State Univ., Corvallis, OR, USA ; Bose, B.

A constant weight, w, code with k information bits and r check bits is a binary code of length n=k+r and cardinality 2/sup k/ such that the number of 1s in each code word is equal to w. When w=~n/2 the code is called balanced. The paper describes the design of constant weight codes with parallel encoding and parallel decoding. Infinite families of efficient constant weight codes are given with the parameters k, r and the "number of balancing functions used in the code design", p. The larger p grows the smaller r will be; and the codes can be encoded and decoded with VLSI circuits whose sizes and depths are proportional to pk and log/sub 2/p respectively. For example, a design is given for a constant weight w=33 code with k=64 information bits, r=10 check bits and p=8 balancing functions. This code can be implemented by a VLSI circuit using less than 4054 transistors with a depth of less than 30 transistors.

Published in:

Fault-Tolerant Computing, 1997. FTCS-27. Digest of Papers., Twenty-Seventh Annual International Symposium on

Date of Conference:

24-27 June 1997