Design of balanced and constant weight codes for VLSI systems

作     者：Tallini, LG Bose, B 

作者机构：Univ Salerno Dipartimento Informat & Applicaz I-84081 Baronissi Salerno Italy Oregon State Univ Dept Comp Sci Corvallis OR 97331 USA 

出 版 物：《IEEE TRANSACTIONS ON COMPUTERS》 (IEEE Trans Comput)

年 卷 期：1998年第47卷第5期

页      面：556-572页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：National Science Foundation, NSF, (MIP-9404924, MIP-9705738) National Science Foundation, NSF Consiglio Nazionale delle Ricerche, CNR, (CNR 203.01.62) Consiglio Nazionale delle Ricerche, CNR 

主　　题：constant weight codes balanced codes parallel encoding parallel decoding VLSI systems 

摘      要：A constant weight, w, code with k information bits and r check bits is a binary code of length n = k + rand cardinality 2(k) such that the number of Is in each code word is equal to w. When w = [n/2], the code is called balanced. This paper describes the design of balanced and 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:! 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 4,054 transistors with a depth of less than 30 transistors.