• DocumentCode
    1401697
  • Title

    Systematic proximity-detecting codes

  • Author

    Vaidya, Nitin H. ; Perisetty, Srinivas

  • Author_Institution
    Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA
  • Volume
    43
  • Issue
    6
  • fYear
    1997
  • fDate
    11/1/1997 12:00:00 AM
  • Firstpage
    1852
  • Lastpage
    1863
  • Abstract
    This paper defines t-proximity-detecting (t-PD) codes that can detect when a received word is within distance t from the transmitted codeword, when using a four-phase asynchronous communication protocol (or other similar protocols). Proximity-detecting codes can be used to improve the performance of asynchronous buses. A nontrivial t-proximity-detecting code must be unordered. However, not all unordered codes are t-proximity-detecting. This paper characterizes t-PD codes, and presents some properties of such codes. Designs of systematic 1-PD codes, and their generalization to t-PD codes are presented, along with a bound on the number of checkbits
  • Keywords
    codes; protocols; asynchronous buses; checkbits number; designs; four-phase asynchronous communication protocol; generalization; nontrivial t-proximity-detecting code; performance; received word; systematic proximity-detecting codes; t-PD codes; transmitted codeword; unordered codes; Asynchronous communication; Computer errors; Computer science; Decoding; Delay; Protocols; Wires;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.641551
  • Filename
    641551