Blaum, Mario and Bruck, Jehoshua (1993) Coding for skew-tolerant parallel asynchronous communications. IEEE Transactions on Information Theory, 39 (2). pp. 379-388. ISSN 0018-9448 http://resolver.caltech.edu/CaltechAUTHORS:BLAieeetit93a
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:BLAieeetit93a
A communication channel consisting of several subchannels transmitting simultaneously and asynchronously is considered, an example being a board with several chips, where the subchannels are wires connecting the chips and differences in the lengths of the wires can result in asynchronous reception. A scheme that allows transmission without an acknowledgment of the message, therefore permitting pipelined communication and providing a higher bandwidth, is described. The scheme allows a certain number of transitions from a second message to arrive before reception of the current message has been completed, a condition called skew. Necessary and sufficient conditions for codes that can detect skew as well as for codes that are skew-tolerant, i.e. can correct the skew and allow continuous operation, are derived. Codes that satisfy the necessary and sufficient conditions are constructed, their optimality is studied, and efficient decoding algorithms are devised. Potential applications of the scheme are in on-chip, on-board, and board to board communications, enabling much higher communication bandwidth.
|Additional Information:||Copyright 1993 IEEE. Reprinted with permission. Manuscript received July 23, 1991. This work was presented in part at the IEEE International Symposium on Information Theory, Budapest, Hungary, June 24-28, 1991 and in part at the Third IMA Conference on Cryptography and Coding, Cirecester, England, December 1991. This work is dedicated to the memory of Joseph T. Downey. The authors thank the referees for their comments that led to an improved presentation of the results in the paper.|
|Subject Keywords:||Parallel asynchronous communications, error-correcting codes, unordered codes, skew, pipelined channel|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Archive Administrator|
|Deposited On:||04 Nov 2007|
|Last Modified:||26 Dec 2012 09:46|
Repository Staff Only: item control page