By Topic

Balanced codes with parallel encoding and decoding

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)
L. G. Tallini ; Politecnico di Milano, Italy ; B. Bose

A balanced code with k information bits and r check bits is a binary code of length n=k+r and cardinality 2k such that the number of 1s in each code word is equal to [n/2]. This paper describes the design of efficient balanced codes with parallel encoding and parallel decoding. In this case, since area and delay of such circuits are critical factors, another parameter is introduced in the definition of balanced code: the “number of balancing functions used in the code design”, p. Parallel encoding and decoding algorithms independent from the chosen balancing method are given and these can be implemented by a VLSI circuit of size O(pk) and depth O(logp). This paper also presents a new balancing method: the permutation method, which, for infinitely many values of k (such as, k=8, 10, 20, 22, 32, 34, ...) is more efficient than Knuth's complementation method. This new method results in efficient balanced codes with k information bits, k even, r=2[k/12]+2 check bits and p=6 balancing functions. Further, Knuth's complementation method is generalized to obtain efficient code designs for any value of the parameters k, r, and p, provided that k⩽2Σi=0m(ir )+p(r-2m-1)[(kr+k+r) mod 2], where m is such that (m-1 r)<p⩽(mr)

Published in:

IEEE Transactions on Computers  (Volume:48 ,  Issue: 8 )