On parallel asynchronous communication codes

In asynchronous buses, the sender encodes a data word with a code word from an unordered code and transmits it on the parallel bus lines. In this paper, some transmission time analyses for the above parallel asynchronous communication scheme are presented. It is proved that the average transmission time for a code word is a strictly increasing function of the weight, w, of the code word and it approaches the worst transmission time possible when w goes to infinity. This implies that the low weight codes result in a faster implementation of the above communication scheme. This paper also analyzes the transmission time performance of the proximity detecting codes; further, some efficient low constant weight code designs are described