Designing concurrent checking sorting networks

The author´s propose two new concurrent error detection (CED) schemes for a class of sorting networks (SNs), e.g., odd-even transposition, bitonic, and perfect shuffle SNs. They propose a CED scheme by which all errors caused by single faults in a concurrent checking SN can be detected. This scheme is the first one available to use significantly less hardware overhead than duplication without compromising throughput. From this scheme, the authors develop another fault detection scheme which sharply reduces the hardware overhead but still achieves virtually complete fault coverage. In addition, a new design for a checker is provided. This checker is used to check the concurrent checking SN, i.e., the SN as well as itself, during normal operation.