Single element correction in sorting algorithms with minimum delay overhead

A low delay overhead technique for the correction of errors affecting sorting algorithms, based on the use of Hamming code, is presented. Given the number of values to be sorted the expected Hamming check bits (as SUMs) are calculated, and a checker technique performs single error correction with lower delay overhead than classic approaches based on algorithm redundancy. The proposed technique has been applied to the well known bubble sorting with different sets of values to be sorted and the comparison of the resulting overhead with that imposed by the classic duplication with comparison and triple modular redundancy techniques shows that it requires lower delay overhead while providing enhanced error correction capabilities.